Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …011111101010001110011111 |
3 | 111020122120002002221122111012 |
4 | 112331321311133222032133 |
5 | 101214431023044213043 |
6 | 554455452432445435 |
7 | 30163543021204133 |
oct | 2675716537521637 |
9 | 436576062848435 |
10 | 101011012101023 |
11 | 2a204590a85602 |
12 | b3b473b6a987b |
13 | 44493b39b509b |
14 | 1ad2d5d9993c3 |
15 | ba27dcbb5a18 |
hex | 5bde757ea39f |
101011012101023 has 2 divisors, whose sum is σ = 101011012101024. Its totient is φ = 101011012101022.
The previous prime is 101011012101011. The next prime is 101011012101037. The reversal of 101011012101023 is 320101210110101.
It is an a-pointer prime, because the next prime (101011012101037) can be obtained adding 101011012101023 to its sum of digits (14).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101011012101023 - 26 = 101011012100959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101011012100989 and 101011012101007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101011012101073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505506050511 + 50505506050512.
It is an arithmetic number, because the mean of its divisors is an integer number (50505506050512).
Almost surely, 2101011012101023 is an apocalyptic number.
101011012101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011012101023 is an equidigital number, since it uses as much as digits as its factorization.
101011012101023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 101011012101023 its reverse (320101210110101), we get a palindrome (421112222211124).
The spelling of 101011012101023 in words is "one hundred one trillion, eleven billion, twelve million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •