Base | Representation |
---|---|
bin | 1001000110000100111110… |
… | …1100110000111101010111 |
3 | 1022101222210122202011110000 |
4 | 2101201033230300331113 |
5 | 2302320020334000043 |
6 | 33133540215102343 |
7 | 2051322562006665 |
oct | 221411754607527 |
9 | 38358718664400 |
10 | 10000021000023 |
11 | 3205a9217770a |
12 | 11560a29719b3 |
13 | 576cc85cbb82 |
14 | 268009c37c35 |
15 | 1251cbbe02d3 |
hex | 9184fb30f57 |
10000021000023 has 40 divisors (see below), whose sum is σ = 15017525865936. Its totient is φ = 6631333401600.
The previous prime is 10000020999989. The next prime is 10000021000027. The reversal of 10000021000023 is 32000012000001.
It is a happy number.
It is not a de Polignac number, because 10000021000023 - 216 = 10000020934487 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10000020999969 and 10000021000014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000021000027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 146462713 + ... + 146530973.
Almost surely, 210000021000023 is an apocalyptic number.
10000021000023 is a deficient number, since it is larger than the sum of its proper divisors (5017504865913).
10000021000023 is an equidigital number, since it uses as much as digits as its factorization.
10000021000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77837 (or 77828 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 10000021000023 its reverse (32000012000001), we get a palindrome (42000033000024).
The spelling of 10000021000023 in words is "ten trillion, twenty-one million, twenty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •