Base | Representation |
---|---|
bin | 101101011111110111100001… |
… | …111100001011000110000111 |
3 | 222020111120021222000200210012 |
4 | 231133313201330023012013 |
5 | 202211432420113013111 |
6 | 1545325333323020435 |
7 | 60101615434106663 |
oct | 5537674174130607 |
9 | 866446258020705 |
10 | 200102022001031 |
11 | 58838877852787 |
12 | 1a53914236a71b |
13 | 8786702979b27 |
14 | 375adbd4298a3 |
15 | 18201a5a8548b |
hex | b5fde1f0b187 |
200102022001031 has 2 divisors, whose sum is σ = 200102022001032. Its totient is φ = 200102022001030.
The previous prime is 200102022000997. The next prime is 200102022001073. The reversal of 200102022001031 is 130100220201002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200102022001031 - 230 = 200100948259207 is a prime.
It is a super-2 number, since 2×2001020220010312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200102022000997 and 200102022001015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200102022031031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100051011000515 + 100051011000516.
It is an arithmetic number, because the mean of its divisors is an integer number (100051011000516).
Almost surely, 2200102022001031 is an apocalyptic number.
200102022001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102022001031 is an equidigital number, since it uses as much as digits as its factorization.
200102022001031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 200102022001031 its reverse (130100220201002), we get a palindrome (330202242202033).
The spelling of 200102022001031 in words is "two hundred trillion, one hundred two billion, twenty-two million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •