Base | Representation |
---|---|
bin | 1010111010100000010011… |
… | …1111001100110010000001 |
3 | 1120111012200010101011212102 |
4 | 2232220010333030302001 |
5 | 3033102423402120223 |
6 | 41304454230440145 |
7 | 2345662460362211 |
oct | 256500477146201 |
9 | 46435603334772 |
10 | 12000222301313 |
11 | 39072a170a0a4 |
12 | 1419882203055 |
13 | 69080178491c |
14 | 2d6b57328241 |
15 | 15c2476d2928 |
hex | aea04fccc81 |
12000222301313 has 8 divisors (see below), whose sum is σ = 12717492968232. Its totient is φ = 11284215549696.
The previous prime is 12000222301289. The next prime is 12000222301369. The reversal of 12000222301313 is 31310322200021.
It can be written as a sum of positive squares in 4 ways, for example, as 42126331009 + 11958095970304 = 205247^2 + 3458048^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12000222301313 - 210 = 12000222300289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12000222301373) 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, 315959270 + ... + 315997247.
It is an arithmetic number, because the mean of its divisors is an integer number (1589686621029).
Almost surely, 212000222301313 is an apocalyptic number.
It is an amenable number.
12000222301313 is a deficient number, since it is larger than the sum of its proper divisors (717270666919).
12000222301313 is a wasteful number, since it uses less digits than its factorization.
12000222301313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 631957651.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12000222301313 its reverse (31310322200021), we get a palindrome (43310544501334).
The spelling of 12000222301313 in words is "twelve trillion, two hundred twenty-two million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •