Base | Representation |
---|---|
bin | 10110111110001101011001… |
… | …000000100001101011011101 |
3 | 111020201120021102100100020002 |
4 | 112332031121000201223131 |
5 | 101220302023301421411 |
6 | 554513244133304045 |
7 | 30165215240053613 |
oct | 2676153100415335 |
9 | 436646242310202 |
10 | 101032009013981 |
11 | 2a21248620a031 |
12 | b3b881b495025 |
13 | 444b37ba88a36 |
14 | 1ad3d924276b3 |
15 | ba311b20333b |
hex | 5be359021add |
101032009013981 has 2 divisors, whose sum is σ = 101032009013982. Its totient is φ = 101032009013980.
The previous prime is 101032009013933. The next prime is 101032009013987. The reversal of 101032009013981 is 189310900230101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86357823137881 + 14674185876100 = 9292891^2 + 3830690^2 .
It is a cyclic number.
It is not a de Polignac number, because 101032009013981 - 234 = 101014829144797 is a prime.
It is a super-2 number, since 2×1010320090139812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101032009013987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50516004506990 + 50516004506991.
It is an arithmetic number, because the mean of its divisors is an integer number (50516004506991).
Almost surely, 2101032009013981 is an apocalyptic number.
It is an amenable number.
101032009013981 is a deficient number, since it is larger than the sum of its proper divisors (1).
101032009013981 is an equidigital number, since it uses as much as digits as its factorization.
101032009013981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 38.
The spelling of 101032009013981 in words is "one hundred one trillion, thirty-two billion, nine million, thirteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •