Base | Representation |
---|---|
bin | 1011110100110111111101… |
… | …0100101000101110100011 |
3 | 1201001002000120112002020201 |
4 | 2331031333110220232203 |
5 | 3201020122020333443 |
6 | 43353255142250031 |
7 | 2511302341250200 |
oct | 275157724505643 |
9 | 51032016462221 |
10 | 13003002121123 |
11 | 41635a6789833 |
12 | 156009b126917 |
13 | 734240933251 |
14 | 32d4c4a20ca7 |
15 | 178387ee934d |
hex | bd37f528ba3 |
13003002121123 has 24 divisors (see below), whose sum is σ = 15808840286400. Its totient is φ = 10650165861888.
The previous prime is 13003002121093. The next prime is 13003002121133. The reversal of 13003002121123 is 32112120030031.
It is a de Polignac number, because none of the positive numbers 2k-13003002121123 is a prime.
It is a super-2 number, since 2×130030021211232 (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 13003002121123.
It is not an unprimeable number, because it can be changed into a prime (13003002121133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47030203 + ... + 47305876.
It is an arithmetic number, because the mean of its divisors is an integer number (658701678600).
Almost surely, 213003002121123 is an apocalyptic number.
13003002121123 is a deficient number, since it is larger than the sum of its proper divisors (2805838165277).
13003002121123 is an equidigital number, since it uses as much as digits as its factorization.
13003002121123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94336219 (or 94336212 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13003002121123 its reverse (32112120030031), we get a palindrome (45115122151154).
The spelling of 13003002121123 in words is "thirteen trillion, three billion, two million, one hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •