Base | Representation |
---|---|
bin | 110111111011100011… |
… | …1010101011001101010 |
3 | 102111000200011210121100 |
4 | 1233313013111121222 |
5 | 3431441130341020 |
6 | 131102222222230 |
7 | 11451303154062 |
oct | 1576707253152 |
9 | 374020153540 |
10 | 120110012010 |
11 | 46a35a7483a |
12 | 1b340724976 |
13 | b431c25031 |
14 | 5b55bc23a2 |
15 | 31ce986a90 |
hex | 1bf71d566a |
120110012010 has 48 divisors (see below), whose sum is σ = 316684442880. Its totient is φ = 31578217440.
The previous prime is 120110012003. The next prime is 120110012023. The reversal of 120110012010 is 10210011021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 120110011983 and 120110012001.
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, 9391890 + ... + 9404669.
It is an arithmetic number, because the mean of its divisors is an integer number (6597592560).
Almost surely, 2120110012010 is an apocalyptic number.
120110012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120110012010 is an abundant number, since it is smaller than the sum of its proper divisors (196574430870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120110012010 is a wasteful number, since it uses less digits than its factorization.
120110012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18796643 (or 18796640 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 120110012010 its reverse (10210011021), we get a palindrome (130320023031).
The spelling of 120110012010 in words is "one hundred twenty billion, one hundred ten million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •