Base | Representation |
---|---|
bin | 11011010010001110101101… |
… | …011100000100110011010010 |
3 | 120201212212222101211222020121 |
4 | 123102032231130010303102 |
5 | 111212040000240213020 |
6 | 1103115123420300454 |
7 | 34163466615431122 |
oct | 3322165534046322 |
9 | 521785871758217 |
10 | 120000001101010 |
11 | 35265795256438 |
12 | 115609796a172a |
13 | 51c5c4a723b64 |
14 | 218c061278c82 |
15 | dd171e7c1baa |
hex | 6d23ad704cd2 |
120000001101010 has 16 divisors (see below), whose sum is σ = 220075473718296. Its totient is φ = 47094340054528.
The previous prime is 120000001100933. The next prime is 120000001101017. The reversal of 120000001101010 is 10101100000021.
It can be written as a sum of positive squares in 4 ways, for example, as 118037729643289 + 1962271457721 = 10864517^2 + 1400811^2 .
It is a junction number, because it is equal to n+sod(n) for n = 120000001100984 and 120000001101002.
It is not an unprimeable number, because it can be changed into a prime (120000001101017) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 113207547679 + ... + 113207548738.
Almost surely, 2120000001101010 is an apocalyptic number.
120000001101010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120000001101010 is a deficient number, since it is larger than the sum of its proper divisors (100075472617286).
120000001101010 is a wasteful number, since it uses less digits than its factorization.
120000001101010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226415096477.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 120000001101010 its reverse (10101100000021), we get a palindrome (130101101101031).
The spelling of 120000001101010 in words is "one hundred twenty trillion, one million, one hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •