Base | Representation |
---|---|
bin | 11101011100000100001… |
… | …100100111000101110001 |
3 | 21011101201100102110210211 |
4 | 131130010030213011301 |
5 | 231121101000323441 |
6 | 4145204155024121 |
7 | 266104553242045 |
oct | 35340414470561 |
9 | 7141640373724 |
10 | 2023000011121 |
11 | 70aa49848641 |
12 | 2880a273b041 |
13 | 1189ca6285cb |
14 | 6dcb1382025 |
15 | 379522e0a81 |
hex | 1d704327171 |
2023000011121 has 8 divisors (see below), whose sum is σ = 2042792036480. Its totient is φ = 2003210894592.
The previous prime is 2023000011107. The next prime is 2023000011173. The reversal of 2023000011121 is 1211100003202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2023000011121 - 225 = 2022966456689 is a prime.
It is a super-2 number, since 2×20230000111212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2023000011521) 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 in 7 ways as a sum of consecutive naturals, for example, 683860 + ... + 2124538.
It is an arithmetic number, because the mean of its divisors is an integer number (255349004560).
Almost surely, 22023000011121 is an apocalyptic number.
It is an amenable number.
2023000011121 is a deficient number, since it is larger than the sum of its proper divisors (19792025359).
2023000011121 is a wasteful number, since it uses less digits than its factorization.
2023000011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1454415.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2023000011121 its reverse (1211100003202), we get a palindrome (3234100014323).
The spelling of 2023000011121 in words is "two trillion, twenty-three billion, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •