Base | Representation |
---|---|
bin | 10110111101110001011100… |
… | …010101100110111010011111 |
3 | 111020121200211001021121120102 |
4 | 112331301130111212322133 |
5 | 101214304044011213043 |
6 | 554451402302211315 |
7 | 30163103501363510 |
oct | 2675613425467237 |
9 | 436550731247512 |
10 | 101002000101023 |
11 | 2a200786a3861a |
12 | b3b2a45583b3b |
13 | 44485a88c2ac8 |
14 | 1ad2746b3ca07 |
15 | ba24619186b8 |
hex | 5bdc5c566e9f |
101002000101023 has 16 divisors (see below), whose sum is σ = 117388118184960. Its totient is φ = 85105217392416.
The previous prime is 101002000101017. The next prime is 101002000101061. The reversal of 101002000101023 is 320101000200101.
It is a cyclic number.
It is not a de Polignac number, because 101002000101023 - 210 = 101002000099999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101002000100995 and 101002000101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002000101073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65803265 + ... + 67320677.
It is an arithmetic number, because the mean of its divisors is an integer number (7336757386560).
Almost surely, 2101002000101023 is an apocalyptic number.
101002000101023 is a deficient number, since it is larger than the sum of its proper divisors (16386118083937).
101002000101023 is a wasteful number, since it uses less digits than its factorization.
101002000101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1678646.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 101002000101023 its reverse (320101000200101), we get a palindrome (421103000301124).
The spelling of 101002000101023 in words is "one hundred one trillion, two billion, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •