Base | Representation |
---|---|
bin | 110111111011010110… |
… | …1110001001101111000 |
3 | 102111000012120022110011 |
4 | 1233312231301031320 |
5 | 3431432421411300 |
6 | 131101422431304 |
7 | 11451162202216 |
oct | 1576655611570 |
9 | 374005508404 |
10 | 120103310200 |
11 | 46a32207655 |
12 | 1b33a432534 |
13 | b430719773 |
14 | 5b54d59cb6 |
15 | 31ce0b0eba |
hex | 1bf6b71378 |
120103310200 has 96 divisors (see below), whose sum is σ = 297301127760. Its totient is φ = 44965324800.
The previous prime is 120103310177. The next prime is 120103310231. The reversal of 120103310200 is 2013301021.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 517819 + ... + 712981.
Almost surely, 2120103310200 is an apocalyptic number.
120103310200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120103310200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148650563880).
120103310200 is an abundant number, since it is smaller than the sum of its proper divisors (177197817560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120103310200 is a wasteful number, since it uses less digits than its factorization.
120103310200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195377 (or 195368 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 120103310200 its reverse (2013301021), we get a palindrome (122116611221).
The spelling of 120103310200 in words is "one hundred twenty billion, one hundred three million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •