Base | Representation |
---|---|
bin | 100001011110111110010… |
… | …011010010010001111101 |
3 | 22010222021122212211100020 |
4 | 201132332103102101331 |
5 | 300144422024330023 |
6 | 4521022004322353 |
7 | 325145634150042 |
oct | 41367623222175 |
9 | 8128248784306 |
10 | 2301000230013 |
11 | 807937708761 |
12 | 311b483a33b9 |
13 | 138ca2680a54 |
14 | 7d52479d1c9 |
15 | 3ecc33b5de3 |
hex | 217be4d247d |
2301000230013 has 8 divisors (see below), whose sum is σ = 3075322504800. Its totient is φ = 1530339054288.
The previous prime is 2301000229991. The next prime is 2301000230017. The reversal of 2301000230013 is 3100320001032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2301000230013 - 26 = 2301000229949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2301000229974 and 2301000230001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2301000230017) 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 7 ways as a sum of consecutive naturals, for example, 915273298 + ... + 915275811.
It is an arithmetic number, because the mean of its divisors is an integer number (384415313100).
Almost surely, 22301000230013 is an apocalyptic number.
It is an amenable number.
2301000230013 is a deficient number, since it is larger than the sum of its proper divisors (774322274787).
2301000230013 is a wasteful number, since it uses less digits than its factorization.
2301000230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1830549531.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 2301000230013 its reverse (3100320001032), we get a palindrome (5401320231045).
The spelling of 2301000230013 in words is "two trillion, three hundred one billion, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •