Base | Representation |
---|---|
bin | 1001010001101110110000… |
… | …0000110111110001011001 |
3 | 1100010010112022110021021120 |
4 | 2110123230000313301121 |
5 | 2314110013233341441 |
6 | 33405525051155453 |
7 | 2101640522355405 |
oct | 224335400676131 |
9 | 40103468407246 |
10 | 10200212012121 |
11 | 328298184204a |
12 | 1188a52445b89 |
13 | 58cb50379351 |
14 | 27399b43c105 |
15 | 12a4e6ce5966 |
hex | 946ec037c59 |
10200212012121 has 8 divisors (see below), whose sum is σ = 13967857890624. Its totient is φ = 6616353737520.
The previous prime is 10200212012033. The next prime is 10200212012131. The reversal of 10200212012121 is 12121021200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10200212012121 - 29 = 10200212011609 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10200212012121.
It is not an unprimeable number, because it can be changed into a prime (10200212012131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45946900845 + ... + 45946901066.
It is an arithmetic number, because the mean of its divisors is an integer number (1745982236328).
Almost surely, 210200212012121 is an apocalyptic number.
It is an amenable number.
10200212012121 is a deficient number, since it is larger than the sum of its proper divisors (3767645878503).
10200212012121 is an equidigital number, since it uses as much as digits as its factorization.
10200212012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91893801951.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10200212012121 its reverse (12121021200201), we get a palindrome (22321233212322).
The spelling of 10200212012121 in words is "ten trillion, two hundred billion, two hundred twelve million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •