Base | Representation |
---|---|
bin | 10111000010100011000000… |
… | …101111000100000010100111 |
3 | 111021210001201000220112022222 |
4 | 113002203000233010002213 |
5 | 101240143022103310043 |
6 | 555302223424542555 |
7 | 30225600250526045 |
oct | 2702430057040247 |
9 | 437701630815288 |
10 | 101330102010023 |
11 | 2a317944a06aa7 |
12 | b446552181a5b |
13 | 44705067a0b23 |
14 | 1b0459019b395 |
15 | baac6626dd68 |
hex | 5c28c0bc40a7 |
101330102010023 has 2 divisors, whose sum is σ = 101330102010024. Its totient is φ = 101330102010022.
The previous prime is 101330102009999. The next prime is 101330102010029. The reversal of 101330102010023 is 320010201033101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101330102010023 - 210 = 101330102008999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101330102009983 and 101330102010010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101330102010029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665051005011 + 50665051005012.
It is an arithmetic number, because the mean of its divisors is an integer number (50665051005012).
Almost surely, 2101330102010023 is an apocalyptic number.
101330102010023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330102010023 is an equidigital number, since it uses as much as digits as its factorization.
101330102010023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101330102010023 its reverse (320010201033101), we get a palindrome (421340303043124).
The spelling of 101330102010023 in words is "one hundred one trillion, three hundred thirty billion, one hundred two million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •