Base | Representation |
---|---|
bin | 11101100011101101110… |
… | …010111010011000011001 |
3 | 21012011220210200221110212 |
4 | 131203231302322120121 |
5 | 231234411303011413 |
6 | 4153043223420505 |
7 | 266515244030630 |
oct | 35435562723031 |
9 | 7164823627425 |
10 | 2031214110233 |
11 | 713484458900 |
12 | 2897b55b4735 |
13 | 119709321299 |
14 | 7045025c517 |
15 | 37c834ccca8 |
hex | 1d8edcba619 |
2031214110233 has 48 divisors (see below), whose sum is σ = 2576167440000. Its totient is φ = 1567543000320.
The previous prime is 2031214110223. The next prime is 2031214110251. The reversal of 2031214110233 is 3320114121302.
It is not a de Polignac number, because 2031214110233 - 240 = 931702482457 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2031214110199 and 2031214110208.
It is not an unprimeable number, because it can be changed into a prime (2031214110223) 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 47 ways as a sum of consecutive naturals, for example, 318418838 + ... + 318425216.
It is an arithmetic number, because the mean of its divisors is an integer number (53670155000).
Almost surely, 22031214110233 is an apocalyptic number.
It is an amenable number.
2031214110233 is a deficient number, since it is larger than the sum of its proper divisors (544953329767).
2031214110233 is a wasteful number, since it uses less digits than its factorization.
2031214110233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9966 (or 9955 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2031214110233 its reverse (3320114121302), we get a palindrome (5351328231535).
The spelling of 2031214110233 in words is "two trillion, thirty-one billion, two hundred fourteen million, one hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •