Base | Representation |
---|---|
bin | 100001110001110110000… |
… | …100110100010011101001 |
3 | 22012220120211110011012000 |
4 | 201301312010310103221 |
5 | 301012421402023103 |
6 | 4534212412441213 |
7 | 326464032422100 |
oct | 41616604642351 |
9 | 8186524404160 |
10 | 2321263314153 |
11 | 815495697793 |
12 | 315a62479209 |
13 | 13ab816cc674 |
14 | 804c79a9037 |
15 | 405ac29caa3 |
hex | 21c761344e9 |
2321263314153 has 192 divisors, whose sum is σ = 4246605792000. Its totient is φ = 1247352680448.
The previous prime is 2321263314101. The next prime is 2321263314197. The reversal of 2321263314153 is 3514133621232.
2321263314153 is a `hidden beast` number, since 2 + 3 + 2 + 1 + 2 + 633 + 1 + 4 + 15 + 3 = 666.
It is not a de Polignac number, because 2321263314153 - 212 = 2321263310057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2321263312153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 641763001 + ... + 641766617.
It is an arithmetic number, because the mean of its divisors is an integer number (22117738500).
Almost surely, 22321263314153 is an apocalyptic number.
It is an amenable number.
2321263314153 is a deficient number, since it is larger than the sum of its proper divisors (1925342477847).
2321263314153 is a wasteful number, since it uses less digits than its factorization.
2321263314153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4101 (or 4088 counting only the distinct ones).
The product of its digits is 77760, while the sum is 36.
Adding to 2321263314153 its reverse (3514133621232), we get a palindrome (5835396935385).
The spelling of 2321263314153 in words is "two trillion, three hundred twenty-one billion, two hundred sixty-three million, three hundred fourteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •