Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …110011000110100110010111 |
3 | 111020121121020102200012000002 |
4 | 112331300200303012212113 |
5 | 101214300022301400043 |
6 | 554451115220241515 |
7 | 30163036652020631 |
oct | 2675604063064627 |
9 | 436547212605002 |
10 | 101001001200023 |
11 | 2a2003140a5501 |
12 | b3b2806b4029b |
13 | 444847997bc22 |
14 | 1ad26901d9a51 |
15 | ba2403da2bb8 |
hex | 5bdc20cc6997 |
101001001200023 has 8 divisors (see below), whose sum is σ = 101444734889280. Its totient is φ = 100557290826720.
The previous prime is 101001001199927. The next prime is 101001001200089. The reversal of 101001001200023 is 320002100100101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101001001200023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101001001199977 and 101001001200013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001001203023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2882258 + ... + 14502048.
It is an arithmetic number, because the mean of its divisors is an integer number (12680591861160).
Almost surely, 2101001001200023 is an apocalyptic number.
101001001200023 is a deficient number, since it is larger than the sum of its proper divisors (443733689257).
101001001200023 is a wasteful number, since it uses less digits than its factorization.
101001001200023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11657977.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 101001001200023 its reverse (320002100100101), we get a palindrome (421003101300124).
The spelling of 101001001200023 in words is "one hundred one trillion, one billion, one million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •