Base | Representation |
---|---|
bin | 11001111001000101… |
… | …10000110000100000 |
3 | 1022212202112001111200 |
4 | 30330202300300200 |
5 | 211432031204311 |
6 | 10215203041200 |
7 | 1001320360653 |
oct | 147442606040 |
9 | 38782461450 |
10 | 13900647456 |
11 | 599360a1a3 |
12 | 283b370200 |
13 | 1406b63ca7 |
14 | 95c21389a |
15 | 56555a556 |
hex | 33c8b0c20 |
13900647456 has 72 divisors (see below), whose sum is σ = 41610507120. Its totient is φ = 4389676416.
The previous prime is 13900647443. The next prime is 13900647493. The reversal of 13900647456 is 65474600931.
13900647456 is a `hidden beast` number, since 139 + 0 + 0 + 64 + 7 + 456 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
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 11 ways as a sum of consecutive naturals, for example, 1264690 + ... + 1275633.
It is an arithmetic number, because the mean of its divisors is an integer number (577923710).
Almost surely, 213900647456 is an apocalyptic number.
13900647456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13900647456 is an abundant number, since it is smaller than the sum of its proper divisors (27709859664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13900647456 is a wasteful number, since it uses less digits than its factorization.
13900647456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2540358 (or 2540347 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 45.
The spelling of 13900647456 in words is "thirteen billion, nine hundred million, six hundred forty-seven thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •