Base | Representation |
---|---|
bin | 11001000010101000100001… |
… | …111001100100000010111011 |
3 | 112102221112020210220101211002 |
4 | 121002220201321210002323 |
5 | 103413401040224021021 |
6 | 1030121555244555215 |
7 | 32124532414301132 |
oct | 3102504171440273 |
9 | 472845223811732 |
10 | 110132120142011 |
11 | 32100851755400 |
12 | 10428414252b0b |
13 | 495b550496a96 |
14 | 1d2a5ccc1a919 |
15 | caebc876b50b |
hex | 642a21e640bb |
110132120142011 has 24 divisors (see below), whose sum is σ = 121249693656000. Its totient is φ = 99958579142400.
The previous prime is 110132120141999. The next prime is 110132120142059. The reversal of 110132120142011 is 110241021231011.
It is a happy number.
It is not a de Polignac number, because 110132120142011 - 218 = 110132119879867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110132120147011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 396663665 + ... + 396941213.
It is an arithmetic number, because the mean of its divisors is an integer number (5052070569000).
Almost surely, 2110132120142011 is an apocalyptic number.
110132120142011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110132120142011 is a deficient number, since it is larger than the sum of its proper divisors (11117573513989).
110132120142011 is a wasteful number, since it uses less digits than its factorization.
110132120142011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282851 (or 282840 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 110132120142011 its reverse (110241021231011), we get a palindrome (220373141373022).
The spelling of 110132120142011 in words is "one hundred ten trillion, one hundred thirty-two billion, one hundred twenty million, one hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •