Base | Representation |
---|---|
bin | 11001000010100111100101… |
… | …101100101011110110001100 |
3 | 112102221102122102101122002211 |
4 | 121002213211230223312030 |
5 | 103413342003143230012 |
6 | 1030121311125000204 |
7 | 32124465401332624 |
oct | 3102474554536614 |
9 | 472842572348084 |
10 | 110131110133132 |
11 | 32100383615820 |
12 | 10428191b53064 |
13 | 495b41c163caa |
14 | 1d2a534a25884 |
15 | caeb69c5e6a7 |
hex | 6429e5b2bd8c |
110131110133132 has 24 divisors (see below), whose sum is σ = 211130009556480. Its totient is φ = 49850141135760.
The previous prime is 110131110133123. The next prime is 110131110133153. The reversal of 110131110133132 is 231331011131011.
It is a super-2 number, since 2×1101311101331322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5236348848 + ... + 5236369879.
It is an arithmetic number, because the mean of its divisors is an integer number (8797083731520).
Almost surely, 2110131110133132 is an apocalyptic number.
It is an amenable number.
110131110133132 is a deficient number, since it is larger than the sum of its proper divisors (100998899423348).
110131110133132 is a wasteful number, since it uses less digits than its factorization.
110131110133132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10472718981 (or 10472718979 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 110131110133132 its reverse (231331011131011), we get a palindrome (341462121264143).
The spelling of 110131110133132 in words is "one hundred ten trillion, one hundred thirty-one billion, one hundred ten million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •