Base | Representation |
---|---|
bin | 11010000100000011… |
… | …11011101011110010 |
3 | 1100010011202001101020 |
4 | 31002001323223302 |
5 | 212124113023004 |
6 | 10232252120310 |
7 | 1003516012410 |
oct | 150201735362 |
9 | 40104661336 |
10 | 13992704754 |
11 | 5a30576206 |
12 | 2866166096 |
13 | 141cc56472 |
14 | 96a5382b0 |
15 | 56d6918d9 |
hex | 34207baf2 |
13992704754 has 32 divisors (see below), whose sum is σ = 32107798656. Its totient is φ = 3982356480.
The previous prime is 13992704749. The next prime is 13992704771. The reversal of 13992704754 is 45740729931.
It is a happy number.
13992704754 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×139927047542 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13992704697 and 13992704706.
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 15 ways as a sum of consecutive naturals, for example, 637377 + ... + 658964.
It is an arithmetic number, because the mean of its divisors is an integer number (1003368708).
Almost surely, 213992704754 is an apocalyptic number.
13992704754 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
13992704754 is an abundant number, since it is smaller than the sum of its proper divisors (18115093902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13992704754 is a wasteful number, since it uses less digits than its factorization.
13992704754 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1296610.
The product of its (nonzero) digits is 1905120, while the sum is 51.
The spelling of 13992704754 in words is "thirteen billion, nine hundred ninety-two million, seven hundred four thousand, seven hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •