Base | Representation |
---|---|
bin | 11001000101011000011100… |
… | …110010110000010001001011 |
3 | 112110121120211002012102210001 |
4 | 121011120130302300101023 |
5 | 103424444413314011021 |
6 | 1030344435043103431 |
7 | 32144300355335215 |
oct | 3105303462602113 |
9 | 473546732172701 |
10 | 110321013032011 |
11 | 32173973880451 |
12 | 10458b50071b77 |
13 | 49732c4628802 |
14 | 1d357cbb095b5 |
15 | cb4a81a45091 |
hex | 64561ccb044b |
110321013032011 has 4 divisors (see below), whose sum is σ = 110321123029024. Its totient is φ = 110320903035000.
The previous prime is 110321013032003. The next prime is 110321013032077. The reversal of 110321013032011 is 110230310123011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110321013032011 - 23 = 110321013032003 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 110321013032011.
It is not an unprimeable number, because it can be changed into a prime (110321013035011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53480115 + ... + 55504636.
It is an arithmetic number, because the mean of its divisors is an integer number (27580280757256).
Almost surely, 2110321013032011 is an apocalyptic number.
110321013032011 is a deficient number, since it is larger than the sum of its proper divisors (109997013).
110321013032011 is a wasteful number, since it uses less digits than its factorization.
110321013032011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109997012.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110321013032011 its reverse (110230310123011), we get a palindrome (220551323155022).
The spelling of 110321013032011 in words is "one hundred ten trillion, three hundred twenty-one billion, thirteen million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •