Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …101110101000110101010011 |
3 | 112102110222212020001211222211 |
4 | 121000232123232220311103 |
5 | 103404224042122042321 |
6 | 1025541434312212551 |
7 | 32112211552364614 |
oct | 3100563356506523 |
9 | 472428766054884 |
10 | 110001020112211 |
11 | 32060197150638 |
12 | 10406b2709a157 |
13 | 494c089730b57 |
14 | 1d24113605c0b |
15 | cab5a40680e1 |
hex | 640b9bba8d53 |
110001020112211 has 8 divisors (see below), whose sum is σ = 118741730856480. Its totient is φ = 101590147509312.
The previous prime is 110001020112209. The next prime is 110001020112227. The reversal of 110001020112211 is 112211020100011.
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 110001020112211 - 21 = 110001020112209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110001020112191 and 110001020112200.
It is not an unprimeable number, because it can be changed into a prime (110001020112271) 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, 82459534650 + ... + 82459535983.
It is an arithmetic number, because the mean of its divisors is an integer number (14842716357060).
Almost surely, 2110001020112211 is an apocalyptic number.
110001020112211 is a deficient number, since it is larger than the sum of its proper divisors (8740710744269).
110001020112211 is a wasteful number, since it uses less digits than its factorization.
110001020112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164919070685.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110001020112211 its reverse (112211020100011), we get a palindrome (222212040212222).
The spelling of 110001020112211 in words is "one hundred ten trillion, one billion, twenty million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •