Base | Representation |
---|---|
bin | 100001011111001011000… |
… | …011111001100001001000 |
3 | 22010222211120200201110212 |
4 | 201133023003321201020 |
5 | 300200341330101412 |
6 | 4521055132500252 |
7 | 325154143545341 |
oct | 41371303714110 |
9 | 8128746621425 |
10 | 2301214300232 |
11 | 807a375308a1 |
12 | 311ba801a688 |
13 | 139007b23413 |
14 | 7d544da50c8 |
15 | 3ecd709e222 |
hex | 217cb0f9848 |
2301214300232 has 8 divisors (see below), whose sum is σ = 4314776812950. Its totient is φ = 1150607150112.
The previous prime is 2301214300211. The next prime is 2301214300237. The reversal of 2301214300232 is 2320034121032.
It can be written as a sum of positive squares in only one way, i.e., 2283707305636 + 17506994596 = 1511194^2 + 132314^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 2301214300198 and 2301214300207.
It is not an unprimeable number, because it can be changed into a prime (2301214300237) 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 as a sum of consecutive naturals, namely, 143825893757 + ... + 143825893772.
Almost surely, 22301214300232 is an apocalyptic number.
It is an amenable number.
2301214300232 is a deficient number, since it is larger than the sum of its proper divisors (2013562512718).
2301214300232 is a wasteful number, since it uses less digits than its factorization.
2301214300232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287651787535 (or 287651787531 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2301214300232 its reverse (2320034121032), we get a palindrome (4621248421264).
The spelling of 2301214300232 in words is "two trillion, three hundred one billion, two hundred fourteen million, three hundred thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •