Base | Representation |
---|---|
bin | 1001001100011111100000… |
… | …1001001111110100000001 |
3 | 1022210112020200220102112022 |
4 | 2103013320021033310001 |
5 | 2311121213113033441 |
6 | 33300323240211225 |
7 | 2062303464305300 |
oct | 223077011176401 |
9 | 38715220812468 |
10 | 10110221221121 |
11 | 32487a23408aa |
12 | 1173518769b15 |
13 | 58450b42c8a8 |
14 | 26d4a185a437 |
15 | 127ecb68784b |
hex | 931f824fd01 |
10110221221121 has 12 divisors (see below), whose sum is σ = 12034378181232. Its totient is φ = 8464371253128.
The previous prime is 10110221221091. The next prime is 10110221221127. The reversal of 10110221221121 is 12112212201101.
It is not a de Polignac number, because 10110221221121 - 26 = 10110221221057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10110221221121.
It is not an unprimeable number, because it can be changed into a prime (10110221221127) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2399196095 + ... + 2399200308.
It is an arithmetic number, because the mean of its divisors is an integer number (1002864848436).
Almost surely, 210110221221121 is an apocalyptic number.
It is an amenable number.
10110221221121 is a deficient number, since it is larger than the sum of its proper divisors (1924156960111).
10110221221121 is an equidigital number, since it uses as much as digits as its factorization.
10110221221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4798396460 (or 4798396453 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10110221221121 its reverse (12112212201101), we get a palindrome (22222433422222).
The spelling of 10110221221121 in words is "ten trillion, one hundred ten billion, two hundred twenty-one million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.244 sec. • engine limits •