Base | Representation |
---|---|
bin | 1001001000111111110010… |
… | …01101011010111100101111 |
3 | 2122011120110202202011121111 |
4 | 10210133321031122330233 |
5 | 10113310440223214043 |
6 | 110425544315012451 |
7 | 4143125663445661 |
oct | 444377115327457 |
9 | 78146422664544 |
10 | 20100333023023 |
11 | 644a559a82280 |
12 | 23076b4a3a127 |
13 | b2a5b7ab4206 |
14 | 4d6c0b60a531 |
15 | 24ccc845409d |
hex | 1247f935af2f |
20100333023023 has 4 divisors (see below), whose sum is σ = 21927636025128. Its totient is φ = 18273030020920.
The previous prime is 20100333023009. The next prime is 20100333023027. The reversal of 20100333023023 is 32032033300102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20100333023023 - 237 = 19962894069551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20100333022985 and 20100333023003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100333023027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 913651501036 + ... + 913651501057.
It is an arithmetic number, because the mean of its divisors is an integer number (5481909006282).
Almost surely, 220100333023023 is an apocalyptic number.
20100333023023 is a deficient number, since it is larger than the sum of its proper divisors (1827303002105).
20100333023023 is a wasteful number, since it uses less digits than its factorization.
20100333023023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1827303002104.
The product of its (nonzero) digits is 1944, while the sum is 22.
Adding to 20100333023023 its reverse (32032033300102), we get a palindrome (52132366323125).
The spelling of 20100333023023 in words is "twenty trillion, one hundred billion, three hundred thirty-three million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •