Base | Representation |
---|---|
bin | 110101001100111011… |
… | …1001000000011100100 |
3 | 101220220022111111022222 |
4 | 1222121313020003210 |
5 | 3332441112432120 |
6 | 124252545011512 |
7 | 11153143231322 |
oct | 1523167100344 |
9 | 356808444288 |
10 | 114250514660 |
11 | 444a9489747 |
12 | 1a186323b98 |
13 | aa09cb1339 |
14 | 575b908d12 |
15 | 2e8a354525 |
hex | 1a99dc80e4 |
114250514660 has 12 divisors (see below), whose sum is σ = 239926080828. Its totient is φ = 45700205856.
The previous prime is 114250514557. The next prime is 114250514671. The reversal of 114250514660 is 66415052411.
It can be written as a sum of positive squares in 2 ways, for example, as 41639667364 + 72610847296 = 204058^2 + 269464^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 114250514660.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2856262847 + ... + 2856262886.
It is an arithmetic number, because the mean of its divisors is an integer number (19993840069).
Almost surely, 2114250514660 is an apocalyptic number.
114250514660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114250514660 is an abundant number, since it is smaller than the sum of its proper divisors (125675566168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114250514660 is a wasteful number, since it uses less digits than its factorization.
114250514660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5712525742 (or 5712525740 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 114250514660 in words is "one hundred fourteen billion, two hundred fifty million, five hundred fourteen thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •