Base | Representation |
---|---|
bin | 11011010101110111… |
… | …00011000011001000 |
3 | 1101212222221012221221 |
4 | 31222323203003020 |
5 | 220030244144330 |
6 | 10424323411424 |
7 | 1026520364416 |
oct | 155273430310 |
9 | 41788835857 |
10 | 14678896840 |
11 | 6252944503 |
12 | 2a17b23b74 |
13 | 14cc16c99a |
14 | 9d371a2b6 |
15 | 5ada37b7a |
hex | 36aee30c8 |
14678896840 has 32 divisors (see below), whose sum is σ = 34970314680. Its totient is φ = 5526172672.
The previous prime is 14678896811. The next prime is 14678896847. The reversal of 14678896840 is 4869887641.
14678896840 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 14669569924 + 9326916 = 121118^2 + 3054^2 .
It is not an unprimeable number, because it can be changed into a prime (14678896847) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 10792627 + ... + 10793986.
Almost surely, 214678896840 is an apocalyptic number.
14678896840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14678896840 is an abundant number, since it is smaller than the sum of its proper divisors (20291417840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14678896840 is a wasteful number, since it uses less digits than its factorization.
14678896840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21586641 (or 21586637 counting only the distinct ones).
The product of its (nonzero) digits is 18579456, while the sum is 61.
The spelling of 14678896840 in words is "fourteen billion, six hundred seventy-eight million, eight hundred ninety-six thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •