Base | Representation |
---|---|
bin | 11001000010100000010100… |
… | …010011000100000101001101 |
3 | 112102220200111021000221110010 |
4 | 121002200110103010011031 |
5 | 103413230010303324323 |
6 | 1030113540241503433 |
7 | 32124101040362031 |
oct | 3102402423040515 |
9 | 472820437027403 |
10 | 110123302011213 |
11 | 320a80370931a7 |
12 | 10426773041b79 |
13 | 495a7765c33ca |
14 | 1d29dd3a281c1 |
15 | cae85e516c93 |
hex | 6428144c414d |
110123302011213 has 16 divisors (see below), whose sum is σ = 147177663290240. Its totient is φ = 73242265265856.
The previous prime is 110123302011211. The next prime is 110123302011221. The reversal of 110123302011213 is 312110203321011.
It is not a de Polignac number, because 110123302011213 - 21 = 110123302011211 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110123302011213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110123302011211) 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, 12571731 + ... + 19449807.
It is an arithmetic number, because the mean of its divisors is an integer number (9198603955640).
Almost surely, 2110123302011213 is an apocalyptic number.
It is an amenable number.
110123302011213 is a deficient number, since it is larger than the sum of its proper divisors (37054361279027).
110123302011213 is a wasteful number, since it uses less digits than its factorization.
110123302011213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6890676.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 110123302011213 its reverse (312110203321011), we get a palindrome (422233505332224).
The spelling of 110123302011213 in words is "one hundred ten trillion, one hundred twenty-three billion, three hundred two million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •