Base | Representation |
---|---|
bin | 11001000010100111101011… |
… | …101110101001010000101010 |
3 | 112102221102220110202221211202 |
4 | 121002213223232221100222 |
5 | 103413342210043410442 |
6 | 1030121325141324202 |
7 | 32124501040326362 |
oct | 3102475356512052 |
9 | 472842813687752 |
10 | 110131211310122 |
11 | 32100425740572 |
12 | 104281bba06662 |
13 | 495b4370ca432 |
14 | 1d2a5442419a2 |
15 | caeb73a97c32 |
hex | 6429ebba942a |
110131211310122 has 32 divisors (see below), whose sum is σ = 174214211361600. Its totient is φ = 52070625750528.
The previous prime is 110131211310097. The next prime is 110131211310139. The reversal of 110131211310122 is 221013112131011.
It is a junction number, because it is equal to n+sod(n) for n = 110131211310094 and 110131211310103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68433404 + ... + 70024232.
It is an arithmetic number, because the mean of its divisors is an integer number (5444194105050).
Almost surely, 2110131211310122 is an apocalyptic number.
110131211310122 is a deficient number, since it is larger than the sum of its proper divisors (64083000051478).
110131211310122 is a wasteful number, since it uses less digits than its factorization.
110131211310122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594230.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 110131211310122 its reverse (221013112131011), we get a palindrome (331144323441133).
The spelling of 110131211310122 in words is "one hundred ten trillion, one hundred thirty-one billion, two hundred eleven million, three hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •