Base | Representation |
---|---|
bin | 110101010000001110… |
… | …0010000001001001010 |
3 | 101221012000020011211110 |
4 | 1222200130100021022 |
5 | 3333202343113120 |
6 | 124311531111150 |
7 | 11155653461655 |
oct | 1524034201112 |
9 | 357160204743 |
10 | 114360910410 |
11 | 445558306aa |
12 | 1a1b72a24b6 |
13 | aa26b24876 |
14 | 576c44489c |
15 | 2e94dae2e0 |
hex | 1aa071024a |
114360910410 has 16 divisors (see below), whose sum is σ = 274466185056. Its totient is φ = 30496242768.
The previous prime is 114360910397. The next prime is 114360910421. The reversal of 114360910410 is 14019063411.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 3812030347 = 114360910410 / (1 + 1 + 4 + 3 + 6 + 0 + 9 + 1 + 0 + 4 + 1 + 0).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1906015144 + ... + 1906015203.
It is an arithmetic number, because the mean of its divisors is an integer number (17154136566).
Almost surely, 2114360910410 is an apocalyptic number.
114360910410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114360910410 is an abundant number, since it is smaller than the sum of its proper divisors (160105274646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114360910410 is a wasteful number, since it uses less digits than its factorization.
114360910410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3812030357.
The product of its (nonzero) digits is 2592, while the sum is 30.
Adding to 114360910410 its reverse (14019063411), we get a palindrome (128379973821).
The spelling of 114360910410 in words is "one hundred fourteen billion, three hundred sixty million, nine hundred ten thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •