Base | Representation |
---|---|
bin | 1010111010101000001000… |
… | …1101001110101101001101 |
3 | 1120111102002112110101201020 |
4 | 2232222002031032231031 |
5 | 3033121224210144323 |
6 | 41305442514504353 |
7 | 2346065520213552 |
oct | 256520215165515 |
9 | 46442075411636 |
10 | 12002323131213 |
11 | 390817a564758 |
12 | 141a1698950b9 |
13 | 690a77aa343c |
14 | 2d6cb634ca29 |
15 | 15c31bd60ae3 |
hex | aea8234eb4d |
12002323131213 has 8 divisors (see below), whose sum is σ = 16003161346848. Its totient is φ = 8001516834864.
The previous prime is 12002323131199. The next prime is 12002323131217. The reversal of 12002323131213 is 31213132320021.
12002323131213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12002323131213 - 217 = 12002323000141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002323131217) 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, 7088206 + ... + 8616687.
It is an arithmetic number, because the mean of its divisors is an integer number (2000395168356).
Almost surely, 212002323131213 is an apocalyptic number.
It is an amenable number.
12002323131213 is a deficient number, since it is larger than the sum of its proper divisors (4000838215635).
12002323131213 is a wasteful number, since it uses less digits than its factorization.
12002323131213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15959643.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 12002323131213 its reverse (31213132320021), we get a palindrome (43215455451234).
The spelling of 12002323131213 in words is "twelve trillion, two billion, three hundred twenty-three million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •