Base | Representation |
---|---|
bin | 11001000100000011101110… |
… | …000001010101111100110010 |
3 | 112110021212222121010110102110 |
4 | 121010003232001111330302 |
5 | 103422002102201422002 |
6 | 1030234551211030150 |
7 | 32134600000416600 |
oct | 3104035601257462 |
9 | 473255877113373 |
10 | 110230034014002 |
11 | 32139327567671 |
12 | 1044339b43b356 |
13 | 4967855a34746 |
14 | 1d3123aba2870 |
15 | cb250977de6c |
hex | 6440ee055f32 |
110230034014002 has 48 divisors (see below), whose sum is σ = 256491106796160. Its totient is φ = 31489683013152.
The previous prime is 110230034013997. The next prime is 110230034014003. The reversal of 110230034014002 is 200410430032011.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 110230034014002.
It is not an unprimeable number, because it can be changed into a prime (110230034014003) 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, 25443738 + ... + 29459189.
It is an arithmetic number, because the mean of its divisors is an integer number (5343564724920).
Almost surely, 2110230034014002 is an apocalyptic number.
110230034014002 is an abundant number, since it is smaller than the sum of its proper divisors (146261072782158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110230034014002 is a wasteful number, since it uses less digits than its factorization.
110230034014002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54909775 (or 54909768 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 110230034014002 its reverse (200410430032011), we get a palindrome (310640464046013).
The spelling of 110230034014002 in words is "one hundred ten trillion, two hundred thirty billion, thirty-four million, fourteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •