Base | Representation |
---|---|
bin | 110101101111100110… |
… | …1100101011110101011 |
3 | 102000220101212012200000 |
4 | 1223133031211132223 |
5 | 3342331442432001 |
6 | 125004231114043 |
7 | 11224032033132 |
oct | 1533715453653 |
9 | 360811765600 |
10 | 115414030251 |
11 | 44a46236183 |
12 | 1a44bb12923 |
13 | ab640701c0 |
14 | 582c25c919 |
15 | 3007584a86 |
hex | 1adf3657ab |
115414030251 has 48 divisors (see below), whose sum is σ = 197134295904. Its totient is φ = 66846104064.
The previous prime is 115414030219. The next prime is 115414030283. The reversal of 115414030251 is 152030414511.
115414030251 is a `hidden beast` number, since 1 + 1 + 5 + 4 + 1 + 403 + 0 + 251 = 666.
It is an interprime number because it is at equal distance from previous prime (115414030219) and next prime (115414030283).
It is not a de Polignac number, because 115414030251 - 25 = 115414030219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (115414030201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1020856 + ... + 1128261.
It is an arithmetic number, because the mean of its divisors is an integer number (4106964498).
Almost surely, 2115414030251 is an apocalyptic number.
115414030251 is a deficient number, since it is larger than the sum of its proper divisors (81720265653).
115414030251 is a wasteful number, since it uses less digits than its factorization.
115414030251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2149162 (or 2149150 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 115414030251 its reverse (152030414511), we get a palindrome (267444444762).
The spelling of 115414030251 in words is "one hundred fifteen billion, four hundred fourteen million, thirty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •