Base | Representation |
---|---|
bin | 1000001100001110001101… |
… | …00111100001010111111101 |
3 | 2100202221110022120122210022 |
4 | 10012013012213201113331 |
5 | 4330102320302334323 |
6 | 102150354111421525 |
7 | 3536222242604444 |
oct | 406070647412775 |
9 | 70687408518708 |
10 | 18012130121213 |
11 | 58149a0972918 |
12 | 202aa55b248a5 |
13 | a086c8b42ba7 |
14 | 463b127bbd5b |
15 | 21380bc7d4c8 |
hex | 1061c69e15fd |
18012130121213 has 16 divisors (see below), whose sum is σ = 19071122112000. Its totient is φ = 16987424975040.
The previous prime is 18012130121207. The next prime is 18012130121239. The reversal of 18012130121213 is 31212103121081.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 18012130121213 - 26 = 18012130121149 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18012130127213) 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 15 ways as a sum of consecutive naturals, for example, 36543623 + ... + 37033236.
It is an arithmetic number, because the mean of its divisors is an integer number (1191945132000).
Almost surely, 218012130121213 is an apocalyptic number.
It is an amenable number.
18012130121213 is a deficient number, since it is larger than the sum of its proper divisors (1058991990787).
18012130121213 is a wasteful number, since it uses less digits than its factorization.
18012130121213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73577092.
The product of its (nonzero) digits is 576, while the sum is 26.
Adding to 18012130121213 its reverse (31212103121081), we get a palindrome (49224233242294).
The spelling of 18012130121213 in words is "eighteen trillion, twelve billion, one hundred thirty million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •