Base | Representation |
---|---|
bin | 1011001101001111000001… |
… | …1100001101010000101001 |
3 | 1121121222020101010120212102 |
4 | 2303103300130031100221 |
5 | 3103340424013143423 |
6 | 42112352042223145 |
7 | 2411143435660661 |
oct | 263236034152051 |
9 | 47558211116772 |
10 | 12322000131113 |
11 | 3a20804927242 |
12 | 1470104ab4ab5 |
13 | 6b4c623b804a |
14 | 3085608d71a1 |
15 | 1657cbc36c28 |
hex | b34f070d429 |
12322000131113 has 8 divisors (see below), whose sum is σ = 12332216963520. Its totient is φ = 12311783714160.
The previous prime is 12322000131097. The next prime is 12322000131187. The reversal of 12322000131113 is 31113100022321.
It is a happy number.
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 12322000131113 - 24 = 12322000131097 is a prime.
It is a super-2 number, since 2×123220001311132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12322000131313) 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, 94960268 + ... + 95089938.
It is an arithmetic number, because the mean of its divisors is an integer number (1541527120440).
Almost surely, 212322000131113 is an apocalyptic number.
It is an amenable number.
12322000131113 is a deficient number, since it is larger than the sum of its proper divisors (10216832407).
12322000131113 is a wasteful number, since it uses less digits than its factorization.
12322000131113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207727.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12322000131113 its reverse (31113100022321), we get a palindrome (43435100153434).
The spelling of 12322000131113 in words is "twelve trillion, three hundred twenty-two billion, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •