Base | Representation |
---|---|
bin | 10111011011001010000100… |
… | …000111011011101111111000 |
3 | 111111202201222200020202112210 |
4 | 113123022010013123233320 |
5 | 102000400111314244112 |
6 | 1003035155520135120 |
7 | 30462020622243105 |
oct | 2733120407335770 |
9 | 444681880222483 |
10 | 103021302103032 |
11 | 2a90a0a8306185 |
12 | b67a2757674a0 |
13 | 4563b37043a31 |
14 | 1b62386cdbaac |
15 | bd9c49237b3c |
hex | 5db2841dbbf8 |
103021302103032 has 128 divisors (see below), whose sum is σ = 282681585849600. Its totient is φ = 31142354073600.
The previous prime is 103021302102997. The next prime is 103021302103073. The reversal of 103021302103032 is 230301203120301.
It is a super-2 number, since 2×1030213021030322 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3057094 + ... + 14676117.
It is an arithmetic number, because the mean of its divisors is an integer number (2208449889450).
Almost surely, 2103021302103032 is an apocalyptic number.
103021302103032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103021302103032 is an abundant number, since it is smaller than the sum of its proper divisors (179660283746568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103021302103032 is a wasteful number, since it uses less digits than its factorization.
103021302103032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17733757 (or 17733753 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 103021302103032 its reverse (230301203120301), we get a palindrome (333322505223333).
The spelling of 103021302103032 in words is "one hundred three trillion, twenty-one billion, three hundred two million, one hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •