Base | Representation |
---|---|
bin | 11101000111000011101… |
… | …00101110111101100001 |
3 | 10112121202010110222112111 |
4 | 32203201310232331201 |
5 | 112341423101010423 |
6 | 2043254545355321 |
7 | 132156261104641 |
oct | 16434164567541 |
9 | 3477663428474 |
10 | 1000221110113 |
11 | 356211817225 |
12 | 141a24038b41 |
13 | 73422034624 |
14 | 365a7962521 |
15 | 1b040d9060d |
hex | e8e1d2ef61 |
1000221110113 has 16 divisors (see below), whose sum is σ = 1063019048976. Its totient is φ = 937866608640.
The previous prime is 1000221110087. The next prime is 1000221110123. The reversal of 1000221110113 is 3110111220001.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 446161210209 + 554059899904 = 667953^2 + 744352^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000221110113 - 25 = 1000221110081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000221110093 and 1000221110102.
It is not an unprimeable number, because it can be changed into a prime (1000221110123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9916053 + ... + 10016413.
It is an arithmetic number, because the mean of its divisors is an integer number (66438690561).
Almost surely, 21000221110113 is an apocalyptic number.
It is an amenable number.
1000221110113 is a deficient number, since it is larger than the sum of its proper divisors (62797938863).
1000221110113 is a wasteful number, since it uses less digits than its factorization.
1000221110113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102564.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1000221110113 its reverse (3110111220001), we get a palindrome (4110332330114).
The spelling of 1000221110113 in words is "one trillion, two hundred twenty-one million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •