Base | Representation |
---|---|
bin | 10111011011010011000110… |
… | …111000001101011010001000 |
3 | 111111210200001101100202000021 |
4 | 113123103012320031122020 |
5 | 102001030003100321300 |
6 | 1003043443223350224 |
7 | 30462513346106053 |
oct | 2733230670153210 |
9 | 444720041322007 |
10 | 103031012120200 |
11 | 2a91323036885a |
12 | b6801255b2374 |
13 | 4564a2392ca18 |
14 | 1b62a28737a9a |
15 | bda116914d1a |
hex | 5db4c6e0d688 |
103031012120200 has 48 divisors (see below), whose sum is σ = 239775026697360. Its totient is φ = 41173192200000.
The previous prime is 103031012120171. The next prime is 103031012120219. The reversal of 103031012120200 is 2021210130301.
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 11 ways as a sum of consecutive naturals, for example, 244868326 + ... + 245288725.
It is an arithmetic number, because the mean of its divisors is an integer number (4995313056195).
Almost surely, 2103031012120200 is an apocalyptic number.
103031012120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103031012120200 is an abundant number, since it is smaller than the sum of its proper divisors (136744014577160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103031012120200 is a wasteful number, since it uses less digits than its factorization.
103031012120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490158118 (or 490158109 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103031012120200 its reverse (2021210130301), we get a palindrome (105052222250501).
The spelling of 103031012120200 in words is "one hundred three trillion, thirty-one billion, twelve million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •