Base | Representation |
---|---|
bin | 10001011110101000010… |
… | …101001110011011101010 |
3 | 11020211022010012121121202 |
4 | 101132220111032123222 |
5 | 124134343210341020 |
6 | 2315441550204202 |
7 | 152530605435122 |
oct | 21365025163352 |
9 | 4224263177552 |
10 | 1201120012010 |
11 | 423434a2a756 |
12 | 1749507b3662 |
13 | 8935a6543c9 |
14 | 421c5195c82 |
15 | 2139d1c5e75 |
hex | 117a854e6ea |
1201120012010 has 32 divisors (see below), whose sum is σ = 2164251074832. Its totient is φ = 479951503360.
The previous prime is 1201120011983. The next prime is 1201120012013. The reversal of 1201120012010 is 102100211021.
It can be written as a sum of positive squares in 8 ways, for example, as 51380648929 + 1149739363081 = 226673^2 + 1072259^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1201120011982 and 1201120012000.
It is not an unprimeable number, because it can be changed into a prime (1201120012013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87531950 + ... + 87545670.
Almost surely, 21201120012010 is an apocalyptic number.
1201120012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1201120012010 is a deficient number, since it is larger than the sum of its proper divisors (963131062822).
1201120012010 is a wasteful number, since it uses less digits than its factorization.
1201120012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22138.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1201120012010 its reverse (102100211021), we get a palindrome (1303220223031).
The spelling of 1201120012010 in words is "one trillion, two hundred one billion, one hundred twenty million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •