Base | Representation |
---|---|
bin | 100001011110011010101… |
… | …001101001111100001001 |
3 | 22010220201222102101211220 |
4 | 201132122221221330021 |
5 | 300142210420124223 |
6 | 4520442400512253 |
7 | 325125052226352 |
oct | 41363251517411 |
9 | 8126658371756 |
10 | 2300402114313 |
11 | 807660027566 |
12 | 311a0001b689 |
13 | 138c08794a34 |
14 | 7d4a9186d29 |
15 | 3ec8ab1b6e3 |
hex | 2179aa69f09 |
2300402114313 has 32 divisors (see below), whose sum is σ = 3216694450176. Its totient is φ = 1459536089088.
The previous prime is 2300402114261. The next prime is 2300402114323. The reversal of 2300402114313 is 3134112040032.
It is a happy number.
2300402114313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2300402114313 - 218 = 2300401852169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2300402114323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25124745 + ... + 25216137.
It is an arithmetic number, because the mean of its divisors is an integer number (100521701568).
Almost surely, 22300402114313 is an apocalyptic number.
2300402114313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2300402114313 is a deficient number, since it is larger than the sum of its proper divisors (916292335863).
2300402114313 is a wasteful number, since it uses less digits than its factorization.
2300402114313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93253.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2300402114313 its reverse (3134112040032), we get a palindrome (5434514154345).
The spelling of 2300402114313 in words is "two trillion, three hundred billion, four hundred two million, one hundred fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •