Base | Representation |
---|---|
bin | 10111001100011110010001… |
… | …000000010010101001101011 |
3 | 111101012021022200112102012211 |
4 | 113030132101000102221223 |
5 | 101332331441430120021 |
6 | 1000543431433545551 |
7 | 30326065303460242 |
oct | 2714362100225153 |
9 | 441167280472184 |
10 | 102012201020011 |
11 | 2a56014a028977 |
12 | b5367938752b7 |
13 | 44bc92b395489 |
14 | 1b295b9c89959 |
15 | bbd8889c93e1 |
hex | 5cc791012a6b |
102012201020011 has 8 divisors (see below), whose sum is σ = 102151527141440. Its totient is φ = 101872886951808.
The previous prime is 102012201019999. The next prime is 102012201020129. The reversal of 102012201020011 is 110020102210201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102012201020011 - 25 = 102012201019979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102012201019973 and 102012201020000.
It is not an unprimeable number, because it can be changed into a prime (102012201020311) 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, 13990675 + ... + 19994083.
It is an arithmetic number, because the mean of its divisors is an integer number (12768940892680).
Almost surely, 2102012201020011 is an apocalyptic number.
102012201020011 is a deficient number, since it is larger than the sum of its proper divisors (139326121429).
102012201020011 is an equidigital number, since it uses as much as digits as its factorization.
102012201020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6026613.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102012201020011 its reverse (110020102210201), we get a palindrome (212032303230212).
The spelling of 102012201020011 in words is "one hundred two trillion, twelve billion, two hundred one million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •