Base | Representation |
---|---|
bin | 11011100000110011111001… |
… | …010110100011011011111010 |
3 | 120212102200022120111210001210 |
4 | 123200303321112203123322 |
5 | 111324444100014231020 |
6 | 1105203315151223550 |
7 | 34326051261421251 |
oct | 3340637126433372 |
9 | 525380276453053 |
10 | 121002002102010 |
11 | 3561172a741a67 |
12 | 116a2bb9817bb6 |
13 | 5269594427553 |
14 | 21c475735b798 |
15 | dec816a473e0 |
hex | 6e0cf95a36fa |
121002002102010 has 64 divisors (see below), whose sum is σ = 307667365286400. Its totient is φ = 30351359603712.
The previous prime is 121002002101927. The next prime is 121002002102017. The reversal of 121002002102010 is 10201200200121.
121002002102010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (121002002102017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68542930 + ... + 70286109.
It is an arithmetic number, because the mean of its divisors is an integer number (4807302582600).
Almost surely, 2121002002102010 is an apocalyptic number.
121002002102010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121002002102010 is an abundant number, since it is smaller than the sum of its proper divisors (186665363184390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121002002102010 is a wasteful number, since it uses less digits than its factorization.
121002002102010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138830775.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 121002002102010 its reverse (10201200200121), we get a palindrome (131203202302131).
The spelling of 121002002102010 in words is "one hundred twenty-one trillion, two billion, two million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •