Base | Representation |
---|---|
bin | 10111000000110011010110… |
… | …000101000101011001100001 |
3 | 111021100121012221001010222202 |
4 | 113000303112011011121201 |
5 | 101231211442430120001 |
6 | 555131154030342545 |
7 | 30214124063113343 |
oct | 2700632605053141 |
9 | 437317187033882 |
10 | 101210201020001 |
11 | 2a281006a27607 |
12 | b42726b65aa55 |
13 | 4462108c71758 |
14 | 1adc858069293 |
15 | ba7a99d2496b |
hex | 5c0cd6145661 |
101210201020001 has 2 divisors, whose sum is σ = 101210201020002. Its totient is φ = 101210201020000.
The previous prime is 101210201019749. The next prime is 101210201020021. The reversal of 101210201020001 is 100020102012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84344386566400 + 16865814453601 = 9183920^2 + 4106801^2 .
It is a cyclic number.
It is not a de Polignac number, because 101210201020001 - 226 = 101210133911137 is a prime.
It is a super-2 number, since 2×1012102010200012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101210201020021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605100510000 + 50605100510001.
It is an arithmetic number, because the mean of its divisors is an integer number (50605100510001).
Almost surely, 2101210201020001 is an apocalyptic number.
It is an amenable number.
101210201020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101210201020001 is an equidigital number, since it uses as much as digits as its factorization.
101210201020001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101210201020001 its reverse (100020102012101), we get a palindrome (201230303032102).
The spelling of 101210201020001 in words is "one hundred one trillion, two hundred ten billion, two hundred one million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •