Base | Representation |
---|---|
bin | 10110111110000011010101… |
… | …010110011001101010101111 |
3 | 111020200112101211111211110001 |
4 | 112332003111112121222233 |
5 | 101220112414304034411 |
6 | 554504300413525131 |
7 | 30164353522614046 |
oct | 2676032526315257 |
9 | 436615354454401 |
10 | 101021210221231 |
11 | 2a208944609223 |
12 | b3b6706aa37a7 |
13 | 444a34a74c041 |
14 | 1ad364a17155d |
15 | ba2bd815adc1 |
hex | 5be0d5599aaf |
101021210221231 has 2 divisors, whose sum is σ = 101021210221232. Its totient is φ = 101021210221230.
The previous prime is 101021210221163. The next prime is 101021210221247. The reversal of 101021210221231 is 132122012120101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101021210221231 - 27 = 101021210221103 is a prime.
It is a super-2 number, since 2×1010212102212312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101021210221199 and 101021210221208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101081210221231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510605110615 + 50510605110616.
It is an arithmetic number, because the mean of its divisors is an integer number (50510605110616).
Almost surely, 2101021210221231 is an apocalyptic number.
101021210221231 is a deficient number, since it is larger than the sum of its proper divisors (1).
101021210221231 is an equidigital number, since it uses as much as digits as its factorization.
101021210221231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 101021210221231 its reverse (132122012120101), we get a palindrome (233143222341332).
The spelling of 101021210221231 in words is "one hundred one trillion, twenty-one billion, two hundred ten million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •