Base | Representation |
---|---|
bin | 111100111110111… |
… | …011100111111110 |
3 | 2122022012101122210 |
4 | 330332323213332 |
5 | 4043410130420 |
6 | 245305121250 |
7 | 34232314422 |
oct | 7476734776 |
9 | 2568171583 |
10 | 1023130110 |
11 | 485591882 |
12 | 246789226 |
13 | 133c78242 |
14 | 99c4cb82 |
15 | 5ec4e9e0 |
hex | 3cfbb9fe |
1023130110 has 32 divisors (see below), whose sum is σ = 2456596512. Its totient is φ = 272714240.
The previous prime is 1023130099. The next prime is 1023130117. The reversal of 1023130110 is 110313201.
It is a super-2 number, since 2×10231301102 = 2093590443977224200, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023130117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77170 + ... + 89450.
It is an arithmetic number, because the mean of its divisors is an integer number (76768641).
Almost surely, 21023130110 is an apocalyptic number.
1023130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1023130110 is an abundant number, since it is smaller than the sum of its proper divisors (1433466402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023130110 is a wasteful number, since it uses less digits than its factorization.
1023130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15068.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1023130110 is about 31986.4050809090. The cubic root of 1023130110 is about 1007.6513442862.
Adding to 1023130110 its reverse (110313201), we get a palindrome (1133443311).
The spelling of 1023130110 in words is "one billion, twenty-three million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •