Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …1011010101110100001001 |
3 | 1022102221211220222021120220 |
4 | 2101222221023111310021 |
5 | 2303001202200401441 |
6 | 33142325414540253 |
7 | 2052130624100016 |
oct | 221525113256411 |
9 | 38387756867526 |
10 | 10010112122121 |
11 | 320a2a036a041 |
12 | 115803a367689 |
13 | 577c46141c37 |
14 | 2686c611a70d |
15 | 1255bca9c466 |
hex | 91aa92d5d09 |
10010112122121 has 8 divisors (see below), whose sum is σ = 13365641012160. Its totient is φ = 6663995656752.
The previous prime is 10010112122083. The next prime is 10010112122183. The reversal of 10010112122121 is 12122121101001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10010112122121 - 217 = 10010111991049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10010112122121.
It is not an unprimeable number, because it can be changed into a prime (10010112102121) 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, 2353103685 + ... + 2353107938.
It is an arithmetic number, because the mean of its divisors is an integer number (1670705126520).
Almost surely, 210010112122121 is an apocalyptic number.
It is an amenable number.
10010112122121 is a deficient number, since it is larger than the sum of its proper divisors (3355528890039).
10010112122121 is an equidigital number, since it uses as much as digits as its factorization.
10010112122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4706212335.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10010112122121 its reverse (12122121101001), we get a palindrome (22132233223122).
The spelling of 10010112122121 in words is "ten trillion, ten billion, one hundred twelve million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •