Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …000011111001011110011010 |
3 | 112110012010001212111212111010 |
4 | 121003220230003321132122 |
5 | 103421013132041200442 |
6 | 1030213351203514350 |
7 | 32132521522262064 |
oct | 3103505403713632 |
9 | 473163055455433 |
10 | 110201010100122 |
11 | 32127a932a3587 |
12 | 1043983b3889b6 |
13 | 4964bab955ac6 |
14 | 1d2da8623c734 |
15 | cb18ab6b0b9c |
hex | 643a2c0f979a |
110201010100122 has 32 divisors (see below), whose sum is σ = 221728077043200. Its totient is φ = 36512836042928.
The previous prime is 110201010100109. The next prime is 110201010100133. The reversal of 110201010100122 is 221001010102011.
It is a junction number, because it is equal to n+sod(n) for n = 110201010100098 and 110201010100107.
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, 19422078 + ... + 24446249.
It is an arithmetic number, because the mean of its divisors is an integer number (6929002407600).
Almost surely, 2110201010100122 is an apocalyptic number.
110201010100122 is an abundant number, since it is smaller than the sum of its proper divisors (111527066943078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201010100122 is a wasteful number, since it uses less digits than its factorization.
110201010100122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43870850.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110201010100122 its reverse (221001010102011), we get a palindrome (331202020202133).
The spelling of 110201010100122 in words is "one hundred ten trillion, two hundred one billion, ten million, one hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •