Base | Representation |
---|---|
bin | 1010111100010111110011… |
… | …1110101101111110011010 |
3 | 1120121021110200121220000010 |
4 | 2233011330332231332122 |
5 | 3034114122323241442 |
6 | 41331321251422350 |
7 | 2351206421205111 |
oct | 257057476557632 |
9 | 46537420556003 |
10 | 12032300212122 |
11 | 3919962874293 |
12 | 1423b34bb49b6 |
13 | 6938444a2538 |
14 | 2d851b70cc78 |
15 | 15cec395db9c |
hex | af17cfadf9a |
12032300212122 has 8 divisors (see below), whose sum is σ = 24064600424256. Its totient is φ = 4010766737372.
The previous prime is 12032300212117. The next prime is 12032300212133. The reversal of 12032300212122 is 22121200323021.
It is a sphenic number, since it is the product of 3 distinct primes.
12032300212122 is an admirable number.
It is a super-2 number, since 2×120323002121222 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1002691684338 + ... + 1002691684349.
It is an arithmetic number, because the mean of its divisors is an integer number (3008075053032).
Almost surely, 212032300212122 is an apocalyptic number.
12032300212122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12032300212122 is a wasteful number, since it uses less digits than its factorization.
12032300212122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005383368692.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12032300212122 its reverse (22121200323021), we get a palindrome (34153500535143).
The spelling of 12032300212122 in words is "twelve trillion, thirty-two billion, three hundred million, two hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •