Base | Representation |
---|---|
bin | 11001000010011101010000… |
… | …001101011100000011100011 |
3 | 112102220100222222200022220021 |
4 | 121002131100031130003203 |
5 | 103413201241110432321 |
6 | 1030112234001454311 |
7 | 32123623362433114 |
oct | 3102352015340343 |
9 | 472810888608807 |
10 | 110120012202211 |
11 | 320a66a9079a90 |
12 | 10425bb5341397 |
13 | 495a370b6b86b |
14 | 1d29ba0b4220b |
15 | cae71a7c8941 |
hex | 64275035c0e3 |
110120012202211 has 8 divisors (see below), whose sum is σ = 122397543580464. Its totient is φ = 98220251020320.
The previous prime is 110120012202133. The next prime is 110120012202223. The reversal of 110120012202211 is 112202210021011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-110120012202211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110120012202241) 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, 94442548476 + ... + 94442549641.
It is an arithmetic number, because the mean of its divisors is an integer number (15299692947558).
Almost surely, 2110120012202211 is an apocalyptic number.
110120012202211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110120012202211 is a deficient number, since it is larger than the sum of its proper divisors (12277531378253).
110120012202211 is a wasteful number, since it uses less digits than its factorization.
110120012202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188885098181.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110120012202211 its reverse (112202210021011), we get a palindrome (222322222223222).
The spelling of 110120012202211 in words is "one hundred ten trillion, one hundred twenty billion, twelve million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •