Base | Representation |
---|---|
bin | 1011000110001000111010… |
… | …1000001001100010000001 |
3 | 1121012022120221112211101010 |
4 | 2301202032220021202001 |
5 | 3044341301100310423 |
6 | 41540352031431133 |
7 | 2366266565023131 |
oct | 261421650114201 |
9 | 47168527484333 |
10 | 12200100010113 |
11 | 3984040444094 |
12 | 14505649854a9 |
13 | 6a6606657032 |
14 | 3026b9094ac1 |
15 | 16254504c693 |
hex | b188ea09881 |
12200100010113 has 8 divisors (see below), whose sum is σ = 16827724152000. Its totient is φ = 7852937937488.
The previous prime is 12200100010069. The next prime is 12200100010157. The reversal of 12200100010113 is 31101000100221.
It is an interprime number because it is at equal distance from previous prime (12200100010069) and next prime (12200100010157).
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 12200100010113 - 229 = 12199563139201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12200100010013) 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, 70115517213 + ... + 70115517386.
It is an arithmetic number, because the mean of its divisors is an integer number (2103465519000).
Almost surely, 212200100010113 is an apocalyptic number.
It is an amenable number.
12200100010113 is a deficient number, since it is larger than the sum of its proper divisors (4627624141887).
12200100010113 is a wasteful number, since it uses less digits than its factorization.
12200100010113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140231034631.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 12200100010113 its reverse (31101000100221), we get a palindrome (43301100110334).
The spelling of 12200100010113 in words is "twelve trillion, two hundred billion, one hundred million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •