Base | Representation |
---|---|
bin | 11001000001000001001010… |
… | …101000101010111110111100 |
3 | 112102112220210000201001221221 |
4 | 121001001022220222332330 |
5 | 103410041240403231030 |
6 | 1025555002244003124 |
7 | 32113523163306133 |
oct | 3101011250527674 |
9 | 472486700631857 |
10 | 110021134430140 |
11 | 3206877916038a |
12 | 1040a9bb3904a4 |
13 | 4950c439c331b |
14 | 1d250a0b6891a |
15 | cabd7ed65e7a |
hex | 64104aa2afbc |
110021134430140 has 24 divisors (see below), whose sum is σ = 231045236029440. Its totient is φ = 44008291157568.
The previous prime is 110021134430107. The next prime is 110021134430149. The reversal of 110021134430140 is 41034431120011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110021134430149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4539580 + ... + 15512899.
It is an arithmetic number, because the mean of its divisors is an integer number (9626884834560).
Almost surely, 2110021134430140 is an apocalyptic number.
110021134430140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110021134430140 is an abundant number, since it is smaller than the sum of its proper divisors (121024101599300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110021134430140 is a wasteful number, since it uses less digits than its factorization.
110021134430140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20326821 (or 20326819 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 110021134430140 its reverse (41034431120011), we get a palindrome (151055565550151).
The spelling of 110021134430140 in words is "one hundred ten trillion, twenty-one billion, one hundred thirty-four million, four hundred thirty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •