Base | Representation |
---|---|
bin | 1010111011010000101100… |
… | …1111101110110101111001 |
3 | 1120112110012102011102100210 |
4 | 2232310023033232311321 |
5 | 3033311024310402223 |
6 | 41314443221221333 |
7 | 2346632411606652 |
oct | 256641317566571 |
9 | 46473172142323 |
10 | 12013212200313 |
11 | 3911858115515 |
12 | 14202a8561849 |
13 | 691ac1a2aaac |
14 | 2d762a5c4529 |
15 | 15c757cdb893 |
hex | aed0b3eed79 |
12013212200313 has 16 divisors (see below), whose sum is σ = 16398424152000. Its totient is φ = 7820226239040.
The previous prime is 12013212200267. The next prime is 12013212200351. The reversal of 12013212200313 is 31300221231021.
It is not a de Polignac number, because 12013212200313 - 28 = 12013212200057 is a prime.
It is a super-2 number, since 2×120132122003132 (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 12013212200313.
It is not an unprimeable number, because it can be changed into a prime (12013212200513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227729518 + ... + 227782263.
It is an arithmetic number, because the mean of its divisors is an integer number (1024901509500).
Almost surely, 212013212200313 is an apocalyptic number.
It is an amenable number.
12013212200313 is a deficient number, since it is larger than the sum of its proper divisors (4385211951687).
12013212200313 is a wasteful number, since it uses less digits than its factorization.
12013212200313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455511992.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12013212200313 its reverse (31300221231021), we get a palindrome (43313433431334).
The spelling of 12013212200313 in words is "twelve trillion, thirteen billion, two hundred twelve million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •