Base | Representation |
---|---|
bin | 1000100111001110… |
… | …0110001011101011 |
3 | 12222010102222201001 |
4 | 2021303212023223 |
5 | 14213333114311 |
6 | 1021230135431 |
7 | 111202466260 |
oct | 21163461353 |
9 | 5863388631 |
10 | 2312004331 |
11 | a8708008a |
12 | 546351577 |
13 | 2aacb9100 |
14 | 17d0b5267 |
15 | d7e934c1 |
hex | 89ce62eb |
2312004331 has 12 divisors (see below), whose sum is σ = 2861180112. Its totient is φ = 1829277216.
The previous prime is 2312004293. The next prime is 2312004347. The reversal of 2312004331 is 1334002132.
It is not a de Polignac number, because 2312004331 - 211 = 2312002283 is a prime.
It is a super-2 number, since 2×23120043312 = 10690728053125515122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2312004299 and 2312004308.
It is not an unprimeable number, because it can be changed into a prime (2312004731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 975996 + ... + 978361.
It is an arithmetic number, because the mean of its divisors is an integer number (238431676).
Almost surely, 22312004331 is an apocalyptic number.
2312004331 is a deficient number, since it is larger than the sum of its proper divisors (549175781).
2312004331 is a wasteful number, since it uses less digits than its factorization.
2312004331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1954390 (or 1954377 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2312004331 is about 48083.3061571269. The cubic root of 2312004331 is about 1322.2986293646.
Adding to 2312004331 its reverse (1334002132), we get a palindrome (3646006463).
The spelling of 2312004331 in words is "two billion, three hundred twelve million, four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •