Base | Representation |
---|---|
bin | 11001000010101001011101… |
… | …100111011000110000000000 |
3 | 112102221121211122002120111001 |
4 | 121002221131213120300000 |
5 | 103413410113213310422 |
6 | 1030122242514301344 |
7 | 32124566301112315 |
oct | 3102513547306000 |
9 | 472847748076431 |
10 | 110133122010112 |
11 | 32101216234773 |
12 | 10428653887854 |
13 | 495b67cc09346 |
14 | 1d2a685cd2d0c |
15 | caec366bb227 |
hex | 642a5d9d8c00 |
110133122010112 has 44 divisors (see below), whose sum is σ = 225278661818056. Its totient is φ = 53785943285760.
The previous prime is 110133122010007. The next prime is 110133122010199. The reversal of 110133122010112 is 211010221331011.
It is a self number, because there is not a number n which added to its sum of digits gives 110133122010112.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1250559189 + ... + 1250647252.
It is an arithmetic number, because the mean of its divisors is an integer number (5119969586774).
Almost surely, 2110133122010112 is an apocalyptic number.
It is an amenable number.
110133122010112 is an abundant number, since it is smaller than the sum of its proper divisors (115145539807944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110133122010112 is an equidigital number, since it uses as much as digits as its factorization.
110133122010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2501206504 (or 2501206486 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 110133122010112 its reverse (211010221331011), we get a palindrome (321143343341123).
The spelling of 110133122010112 in words is "one hundred ten trillion, one hundred thirty-three billion, one hundred twenty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •