Base | Representation |
---|---|
bin | 1010100110101101000111… |
… | …00001110100010001000111 |
3 | 10001120101022022212120022101 |
4 | 11103112203201310101013 |
5 | 11024034101434013111 |
6 | 121333040553412531 |
7 | 4624552223626051 |
oct | 523264341642107 |
9 | 101511268776271 |
10 | 23320121001031 |
11 | 748100a394988 |
12 | 274771940a147 |
13 | 10021024048ba |
14 | 5a89b26788d1 |
15 | 2a6923456bc1 |
hex | 1535a3874447 |
23320121001031 has 4 divisors (see below), whose sum is σ = 23341263450912. Its totient is φ = 23298978551152.
The previous prime is 23320121001011. The next prime is 23320121001049. The reversal of 23320121001031 is 13010012102332.
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 23320121001031 - 27 = 23320121000903 is a prime.
It is a super-2 number, since 2×233201210010312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23320121001011) 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, 10571223286 + ... + 10571225491.
It is an arithmetic number, because the mean of its divisors is an integer number (5835315862728).
Almost surely, 223320121001031 is an apocalyptic number.
23320121001031 is a deficient number, since it is larger than the sum of its proper divisors (21142449881).
23320121001031 is a wasteful number, since it uses less digits than its factorization.
23320121001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21142449880.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 23320121001031 its reverse (13010012102332), we get a palindrome (36330133103363).
The spelling of 23320121001031 in words is "twenty-three trillion, three hundred twenty billion, one hundred twenty-one million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •