Base | Representation |
---|---|
bin | 11001010110111111… |
… | …00110011010011110 |
3 | 1022010211021122101000 |
4 | 30223133212122132 |
5 | 210340314342412 |
6 | 10130544131130 |
7 | 661245145545 |
oct | 145337463236 |
9 | 38124248330 |
10 | 13614605982 |
11 | 58570a9a8a |
12 | 277b606aa6 |
13 | 138c812793 |
14 | 93223515c |
15 | 54a3a74dc |
hex | 32b7e669e |
13614605982 has 64 divisors (see below), whose sum is σ = 30976142400. Its totient is φ = 4431075840.
The previous prime is 13614605911. The next prime is 13614605999. The reversal of 13614605982 is 28950641631.
13614605982 is a `hidden beast` number, since 1 + 3 + 61 + 460 + 59 + 82 = 666.
It is a super-2 number, since 2×136146059822 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 436194 + ... + 466362.
It is an arithmetic number, because the mean of its divisors is an integer number (484002225).
Almost surely, 213614605982 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13614605982, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15488071200).
13614605982 is an abundant number, since it is smaller than the sum of its proper divisors (17361536418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13614605982 is a wasteful number, since it uses less digits than its factorization.
13614605982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30378 (or 30372 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 13614605982 in words is "thirteen billion, six hundred fourteen million, six hundred five thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •