Base | Representation |
---|---|
bin | 10111011111011000111001… |
… | …000001110000101110001000 |
3 | 111112210112120212222122120211 |
4 | 113133120321001300232020 |
5 | 102020131140111213000 |
6 | 1003420531254330504 |
7 | 30522024102401260 |
oct | 2737307101605610 |
9 | 445715525878524 |
10 | 103312100101000 |
11 | 2aa1146319111a |
12 | b7066b1359a34 |
13 | 458539b5b6a0b |
14 | 1b72491c847a0 |
15 | be25b8b177ba |
hex | 5df639070b88 |
103312100101000 has 64 divisors (see below), whose sum is σ = 276286073431680. Its totient is φ = 35421291460800.
The previous prime is 103312100100973. The next prime is 103312100101019. The reversal of 103312100101000 is 101001213301.
It is an unprimeable number.
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, 7379428722 + ... + 7379442721.
It is an arithmetic number, because the mean of its divisors is an integer number (4316969897370).
Almost surely, 2103312100101000 is an apocalyptic number.
103312100101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103312100101000 is an abundant number, since it is smaller than the sum of its proper divisors (172973973330680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103312100101000 is a wasteful number, since it uses less digits than its factorization.
103312100101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14758871471 (or 14758871457 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 103312100101000 its reverse (101001213301), we get a palindrome (103413101314301).
The spelling of 103312100101000 in words is "one hundred three trillion, three hundred twelve billion, one hundred million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •