Base | Representation |
---|---|
bin | 10110111110000101000001… |
… | …001110001111110011111001 |
3 | 111020200201001221222021210102 |
4 | 112332011001032033303321 |
5 | 101220130121111214113 |
6 | 554505200144125145 |
7 | 30164446416644123 |
oct | 2676050116176371 |
9 | 436621057867712 |
10 | 101023020023033 |
11 | 2a209693158099 |
12 | b3b6b310067b5 |
13 | 444a578691694 |
14 | 1ad377c67a213 |
15 | ba2c91e9d758 |
hex | 5be14138fcf9 |
101023020023033 has 2 divisors, whose sum is σ = 101023020023034. Its totient is φ = 101023020023032.
The previous prime is 101023020022949. The next prime is 101023020023059. The reversal of 101023020023033 is 330320020320101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60438310027264 + 40584709995769 = 7774208^2 + 6370613^2 .
It is a cyclic number.
It is not a de Polignac number, because 101023020023033 - 220 = 101023018974457 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101023020022996 and 101023020023014.
It is not a weakly prime, because it can be changed into another prime (101023025023033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50511510011516 + 50511510011517.
It is an arithmetic number, because the mean of its divisors is an integer number (50511510011517).
Almost surely, 2101023020023033 is an apocalyptic number.
It is an amenable number.
101023020023033 is a deficient number, since it is larger than the sum of its proper divisors (1).
101023020023033 is an equidigital number, since it uses as much as digits as its factorization.
101023020023033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 101023020023033 its reverse (330320020320101), we get a palindrome (431343040343134).
The spelling of 101023020023033 in words is "one hundred one trillion, twenty-three billion, twenty million, twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •