Base | Representation |
---|---|
bin | 11011010011110101001010… |
… | …000000001111111101101010 |
3 | 120202021101220112222020021102 |
4 | 123103311022000033331222 |
5 | 111220340241003341020 |
6 | 1103241435001441402 |
7 | 34204442550644423 |
oct | 3323651200177552 |
9 | 522241815866242 |
10 | 120110002012010 |
11 | 352a8402968a3a |
12 | 1157a1587a0262 |
13 | 520342b17c5ca |
14 | 21934d861864a |
15 | dd450b9e9475 |
hex | 6d3d4a00ff6a |
120110002012010 has 8 divisors (see below), whose sum is σ = 216198003621636. Its totient is φ = 48044000804800.
The previous prime is 120110002011929. The next prime is 120110002012027. The reversal of 120110002012010 is 10210200011021.
It can be written as a sum of positive squares in 2 ways, for example, as 115624234742641 + 4485767269369 = 10752871^2 + 2117963^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1201100020120103 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120110002011982 and 120110002012000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6005500100591 + ... + 6005500100610.
Almost surely, 2120110002012010 is an apocalyptic number.
120110002012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120110002012010 is a deficient number, since it is larger than the sum of its proper divisors (96088001609626).
120110002012010 is a wasteful number, since it uses less digits than its factorization.
120110002012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12011000201208.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120110002012010 its reverse (10210200011021), we get a palindrome (130320202023031).
The spelling of 120110002012010 in words is "one hundred twenty trillion, one hundred ten billion, two million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •