Base | Representation |
---|---|
bin | 11001000010101000110100… |
… | …011011100011111000001000 |
3 | 112102221120001110220212022102 |
4 | 121002220310123203320020 |
5 | 103413402204321402404 |
6 | 1030122050152412532 |
7 | 32124543211025210 |
oct | 3102506433437010 |
9 | 472846043825272 |
10 | 110132431044104 |
11 | 321009a11a5787 |
12 | 104284a03a7148 |
13 | 495b59ca10c11 |
14 | 1d2a61c22b240 |
15 | caebe5bd071e |
hex | 642a346e3e08 |
110132431044104 has 64 divisors (see below), whose sum is σ = 249929905881600. Its totient is φ = 44414347659264.
The previous prime is 110132431044037. The next prime is 110132431044107. The reversal of 110132431044104 is 401440134231011.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (110132431044107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6681869 + ... + 16276124.
It is an arithmetic number, because the mean of its divisors is an integer number (3905154779400).
Almost surely, 2110132431044104 is an apocalyptic number.
110132431044104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
110132431044104 is an abundant number, since it is smaller than the sum of its proper divisors (139797474837496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110132431044104 is a wasteful number, since it uses less digits than its factorization.
110132431044104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22963062 (or 22963058 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 110132431044104 its reverse (401440134231011), we get a palindrome (511572565275115).
The spelling of 110132431044104 in words is "one hundred ten trillion, one hundred thirty-two billion, four hundred thirty-one million, forty-four thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •