Base | Representation |
---|---|
bin | 11110110001000111011… |
… | …110001101111001110000 |
3 | 21111010102210202122122100 |
4 | 132301013132031321300 |
5 | 234120113142410412 |
6 | 4255150115540400 |
7 | 305516616040443 |
oct | 36610736157160 |
9 | 7433383678570 |
10 | 2114323013232 |
11 | 745752247801 |
12 | 2a192a5ba700 |
13 | 1244c257a571 |
14 | 74495c6b65a |
15 | 39ee98a2edc |
hex | 1ec4778de70 |
2114323013232 has 60 divisors (see below), whose sum is σ = 5917288316680. Its totient is φ = 704759992704.
The previous prime is 2114323013203. The next prime is 2114323013237. The reversal of 2114323013232 is 2323103234112.
2114323013232 is a `hidden beast` number, since 2 + 1 + 1 + 4 + 32 + 301 + 323 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 2114323013196 and 2114323013205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2114323013237) 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 11 ways as a sum of consecutive naturals, for example, 8807694 + ... + 9044562.
Almost surely, 22114323013232 is an apocalyptic number.
It is an amenable number.
2114323013232 is an abundant number, since it is smaller than the sum of its proper divisors (3802965303448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2114323013232 is a wasteful number, since it uses less digits than its factorization.
2114323013232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298870 (or 298861 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 2114323013232 its reverse (2323103234112), we get a palindrome (4437426247344).
The spelling of 2114323013232 in words is "two trillion, one hundred fourteen billion, three hundred twenty-three million, thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •