Base | Representation |
---|---|
bin | 11001000010010000010011… |
… | …010011100110010011110101 |
3 | 112102212001002210202220201002 |
4 | 121002100103103212103311 |
5 | 103412434301002130023 |
6 | 1030102014021013045 |
7 | 32122621636444322 |
oct | 3102202323462365 |
9 | 472761083686632 |
10 | 110106105505013 |
11 | 320a0812108602 |
12 | 10423373b54185 |
13 | 4958c6599a057 |
14 | 1d29241bd5b49 |
15 | cae1a4975b28 |
hex | 6424134e64f5 |
110106105505013 has 8 divisors (see below), whose sum is σ = 118494130901400. Its totient is φ = 101930435182080.
The previous prime is 110106105504973. The next prime is 110106105505069. The reversal of 110106105505013 is 310505501601011.
It can be written as a sum of positive squares in 4 ways, for example, as 35118507131569 + 74987598373444 = 5926087^2 + 8659538^2 .
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 110106105505013 - 226 = 110106038396149 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110106105501013) 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, 53088767288 + ... + 53088769361.
It is an arithmetic number, because the mean of its divisors is an integer number (14811766362675).
Almost surely, 2110106105505013 is an apocalyptic number.
It is an amenable number.
110106105505013 is a deficient number, since it is larger than the sum of its proper divisors (8388025396387).
110106105505013 is a wasteful number, since it uses less digits than its factorization.
110106105505013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106177536727.
The product of its (nonzero) digits is 2250, while the sum is 29.
The spelling of 110106105505013 in words is "one hundred ten trillion, one hundred six billion, one hundred five million, five hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •