Base | Representation |
---|---|
bin | 101010001010000… |
… | …0001101000000000 |
3 | 10122120200212011101 |
4 | 1110110001220000 |
5 | 10344110120210 |
6 | 352210224144 |
7 | 50024232505 |
oct | 12424015000 |
9 | 3576625141 |
10 | 1414535680 |
11 | 666517658 |
12 | 335885054 |
13 | 19709a97c |
14 | d5c174ac |
15 | 842b6a3a |
hex | 54501a00 |
1414535680 has 40 divisors (see below), whose sum is σ = 3391576452. Its totient is φ = 565813248.
The previous prime is 1414535669. The next prime is 1414535687. The reversal of 1414535680 is 865354141.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1369592064 + 44943616 = 37008^2 + 6704^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×14145356802 = 4001822379986124800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1414535687) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 273717 + ... + 278836.
Almost surely, 21414535680 is an apocalyptic number.
1414535680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1414535680 is an abundant number, since it is smaller than the sum of its proper divisors (1977040772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414535680 is an frugal number, since it uses more digits than its factorization.
1414535680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 552576 (or 552560 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 37.
The square root of 1414535680 is about 37610.3134791509. The cubic root of 1414535680 is about 1122.5472634831.
The spelling of 1414535680 in words is "one billion, four hundred fourteen million, five hundred thirty-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •