Base | Representation |
---|---|
bin | 11101011100000110000… |
… | …011101000100001011001 |
3 | 21011101210112010122112102 |
4 | 131130012003220201121 |
5 | 231121131442241441 |
6 | 4145211231453145 |
7 | 266105412402053 |
oct | 35340603504131 |
9 | 7141715118472 |
10 | 2023031212121 |
11 | 70aa65419397 |
12 | 2880b10871b5 |
13 | 118a03c3113a |
14 | 6dcb55848d3 |
15 | 37954e0569b |
hex | 1d7060e8859 |
2023031212121 has 4 divisors (see below), whose sum is σ = 2038960591872. Its totient is φ = 2007101832372.
The previous prime is 2023031212061. The next prime is 2023031212201. The reversal of 2023031212121 is 1212121303202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-2023031212121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2023031212093 and 2023031212102.
It is not an unprimeable number, because it can be changed into a prime (2023031217121) 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, 7964689685 + ... + 7964689938.
It is an arithmetic number, because the mean of its divisors is an integer number (509740147968).
Almost surely, 22023031212121 is an apocalyptic number.
It is an amenable number.
2023031212121 is a deficient number, since it is larger than the sum of its proper divisors (15929379751).
2023031212121 is a wasteful number, since it uses less digits than its factorization.
2023031212121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15929379750.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2023031212121 its reverse (1212121303202), we get a palindrome (3235152515323).
The spelling of 2023031212121 in words is "two trillion, twenty-three billion, thirty-one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.856 sec. • engine limits •