Base | Representation |
---|---|
bin | 1011010001110101011100… |
… | …0011000011100011001001 |
3 | 1121220112020011122211002010 |
4 | 2310131113003003203021 |
5 | 3111134302414033223 |
6 | 42212542140130133 |
7 | 2416642052206122 |
oct | 264352703034311 |
9 | 47815204584063 |
10 | 12401031002313 |
11 | 3a5127a785528 |
12 | 14834a0236949 |
13 | 6bc548801365 |
14 | 30c2daa7d049 |
15 | 1678a50c1393 |
hex | b47570c38c9 |
12401031002313 has 12 divisors (see below), whose sum is σ = 17450758309488. Its totient is φ = 7832230106040.
The previous prime is 12401031002281. The next prime is 12401031002363. The reversal of 12401031002313 is 31320013010421.
It is not a de Polignac number, because 12401031002313 - 25 = 12401031002281 is a prime.
It is a super-2 number, since 2×124010310023132 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12401031002313.
It is not an unprimeable number, because it can be changed into a prime (12401031002363) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5725313323 + ... + 5725315488.
It is an arithmetic number, because the mean of its divisors is an integer number (1454229859124).
Almost surely, 212401031002313 is an apocalyptic number.
It is an amenable number.
12401031002313 is a deficient number, since it is larger than the sum of its proper divisors (5049727307175).
12401031002313 is a wasteful number, since it uses less digits than its factorization.
12401031002313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11450628852 (or 11450628833 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12401031002313 its reverse (31320013010421), we get a palindrome (43721044012734).
The spelling of 12401031002313 in words is "twelve trillion, four hundred one billion, thirty-one million, two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •