Base | Representation |
---|---|
bin | 10110111010011001… |
… | …00110000100110101 |
3 | 1011202021111121010010 |
4 | 23131030212010311 |
5 | 200143024013023 |
6 | 5352341050433 |
7 | 613554532500 |
oct | 133514460465 |
9 | 34667447103 |
10 | 12301001013 |
11 | 524265a144 |
12 | 24736b6a19 |
13 | 1210623132 |
14 | 8499b2137 |
15 | 4bedcb093 |
hex | 2dd326135 |
12301001013 has 96 divisors (see below), whose sum is σ = 20519212032. Its totient is φ = 6519744000.
The previous prime is 12301001003. The next prime is 12301001057. The reversal of 12301001013 is 31010010321.
12301001013 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 12301001013 - 214 = 12300984629 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12301001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12301001003) 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 95 ways as a sum of consecutive naturals, for example, 30675613 + ... + 30676013.
It is an arithmetic number, because the mean of its divisors is an integer number (213741792).
Almost surely, 212301001013 is an apocalyptic number.
It is an amenable number.
12301001013 is a deficient number, since it is larger than the sum of its proper divisors (8218211019).
12301001013 is a wasteful number, since it uses less digits than its factorization.
12301001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695 (or 688 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 12301001013 its reverse (31010010321), we get a palindrome (43311011334).
The spelling of 12301001013 in words is "twelve billion, three hundred one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •