Base | Representation |
---|---|
bin | 100001011111000000001… |
… | …000101101011100010001 |
3 | 22010222100210210201110000 |
4 | 201133000020231130101 |
5 | 300200002414341423 |
6 | 4521025024200213 |
7 | 325146456613551 |
oct | 41370010553421 |
9 | 8128323721400 |
10 | 2301031012113 |
11 | 807953022809 |
12 | 311b56769069 |
13 | 138ca8b6aa02 |
14 | 7d5288d3161 |
15 | 3ecc5e46843 |
hex | 217c022d711 |
2301031012113 has 20 divisors (see below), whose sum is σ = 3440670282148. Its totient is φ = 1532535603840.
The previous prime is 2301031012097. The next prime is 2301031012141. The reversal of 2301031012113 is 3112101301032.
2301031012113 is a `hidden beast` number, since 230 + 1 + 0 + 310 + 12 + 113 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1463306347584 + 837724664529 = 1209672^2 + 915273^2 .
It is not a de Polignac number, because 2301031012113 - 24 = 2301031012097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2301031012613) 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 19 ways as a sum of consecutive naturals, for example, 13666468 + ... + 13833813.
Almost surely, 22301031012113 is an apocalyptic number.
It is an amenable number.
2301031012113 is a deficient number, since it is larger than the sum of its proper divisors (1139639270035).
2301031012113 is a wasteful number, since it uses less digits than its factorization.
2301031012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27501326 (or 27501317 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 2301031012113 its reverse (3112101301032), we get a palindrome (5413132313145).
The spelling of 2301031012113 in words is "two trillion, three hundred one billion, thirty-one million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •