Base | Representation |
---|---|
bin | 1011110101011001100100… |
… | …0101111111011101111001 |
3 | 1201001221022100120120111010 |
4 | 2331112121011333131321 |
5 | 3201142111223034223 |
6 | 43401350321424133 |
7 | 2512042044462135 |
oct | 275263105773571 |
9 | 51057270516433 |
10 | 13012024424313 |
11 | 4167406623752 |
12 | 156199879b049 |
13 | 73504abc20a5 |
14 | 32dadcda03c5 |
15 | 17871512e393 |
hex | bd59917f779 |
13012024424313 has 8 divisors (see below), whose sum is σ = 17359613611648. Its totient is φ = 8669559093264.
The previous prime is 13012024424309. The next prime is 13012024424317. The reversal of 13012024424313 is 31342442021031.
It is an interprime number because it is at equal distance from previous prime (13012024424309) and next prime (13012024424317).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13012024424313 - 22 = 13012024424309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13012024424317) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1280958145 + ... + 1280968302.
It is an arithmetic number, because the mean of its divisors is an integer number (2169951701456).
Almost surely, 213012024424313 is an apocalyptic number.
It is an amenable number.
13012024424313 is a deficient number, since it is larger than the sum of its proper divisors (4347589187335).
13012024424313 is a wasteful number, since it uses less digits than its factorization.
13012024424313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2561928143.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 13012024424313 its reverse (31342442021031), we get a palindrome (44354466445344).
The spelling of 13012024424313 in words is "thirteen trillion, twelve billion, twenty-four million, four hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •