Base | Representation |
---|---|
bin | 11001000011101110011000… |
… | …110101111001001111110110 |
3 | 112110012200212101101201220021 |
4 | 121003232120311321033312 |
5 | 103421113200302104024 |
6 | 1030220242344555354 |
7 | 32133126264444214 |
oct | 3103563065711766 |
9 | 473180771351807 |
10 | 110207130113014 |
11 | 3212a643944880 |
12 | 1043aa68a82b5a |
13 | 49656458515cc |
14 | 1d300a6d6bcb4 |
15 | cb1b18b02de4 |
hex | 643b98d793f6 |
110207130113014 has 32 divisors (see below), whose sum is σ = 196376341420800. Its totient is φ = 45821146321440.
The previous prime is 110207130112969. The next prime is 110207130113039. The reversal of 110207130113014 is 410311031702011.
It is a super-2 number, since 2×1102071301130142 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110207130113014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4545736522 + ... + 4545760765.
It is an arithmetic number, because the mean of its divisors is an integer number (6136760669400).
Almost surely, 2110207130113014 is an apocalyptic number.
110207130113014 is a deficient number, since it is larger than the sum of its proper divisors (86169211307786).
110207130113014 is a wasteful number, since it uses less digits than its factorization.
110207130113014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9091497348.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 110207130113014 its reverse (410311031702011), we get a palindrome (520518161815025).
The spelling of 110207130113014 in words is "one hundred ten trillion, two hundred seven billion, one hundred thirty million, one hundred thirteen thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •