Base | Representation |
---|---|
bin | 100001101001001110101… |
… | …001111001011100111011 |
3 | 22012000201002111021111110 |
4 | 201221032221321130323 |
5 | 300340000033330243 |
6 | 4530042413131403 |
7 | 326015545561530 |
oct | 41511651713473 |
9 | 8160632437443 |
10 | 2312012011323 |
11 | 811578562a73 |
12 | 314100189b63 |
13 | 13a038b71991 |
14 | 7dc8b058d87 |
15 | 40219ed0e33 |
hex | 21a4ea7973b |
2312012011323 has 16 divisors (see below), whose sum is σ = 3523426062336. Its totient is φ = 1321014668160.
The previous prime is 2312012011279. The next prime is 2312012011327. The reversal of 2312012011323 is 3231102102132.
It is not a de Polignac number, because 2312012011323 - 26 = 2312012011259 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 2312012011323.
It is not an unprimeable number, because it can be changed into a prime (2312012011327) 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 15 ways as a sum of consecutive naturals, for example, 5416686 + ... + 5827907.
It is an arithmetic number, because the mean of its divisors is an integer number (220214128896).
Almost surely, 22312012011323 is an apocalyptic number.
2312012011323 is a deficient number, since it is larger than the sum of its proper divisors (1211414051013).
2312012011323 is a wasteful number, since it uses less digits than its factorization.
2312012011323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11254394.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2312012011323 its reverse (3231102102132), we get a palindrome (5543114113455).
The spelling of 2312012011323 in words is "two trillion, three hundred twelve billion, twelve million, eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •