Base | Representation |
---|---|
bin | 11011010101100111… |
… | …10101000011000001 |
3 | 1101212212010102100001 |
4 | 31222303311003001 |
5 | 220024234422114 |
6 | 10424212200001 |
7 | 1026464236252 |
oct | 155263650301 |
9 | 41785112301 |
10 | 14676873409 |
11 | 6251792250 |
12 | 2a17309001 |
13 | 14cb9119a3 |
14 | 9d3350b29 |
15 | 5ad788374 |
hex | 36acf50c1 |
14676873409 has 16 divisors (see below), whose sum is σ = 16132431744. Its totient is φ = 13241910400.
The previous prime is 14676873403. The next prime is 14676873439. The reversal of 14676873409 is 90437867641.
14676873409 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14676873409 - 23 = 14676873401 is a prime.
It is a super-2 number, since 2×146768734092 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14676873409.
It is not an unprimeable number, because it can be changed into a prime (14676873401) 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 15 ways as a sum of consecutive naturals, for example, 787887 + ... + 806299.
It is an arithmetic number, because the mean of its divisors is an integer number (1008276984).
Almost surely, 214676873409 is an apocalyptic number.
It is an amenable number.
14676873409 is a deficient number, since it is larger than the sum of its proper divisors (1455558335).
14676873409 is a wasteful number, since it uses less digits than its factorization.
14676873409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18968.
The product of its (nonzero) digits is 6096384, while the sum is 55.
The spelling of 14676873409 in words is "fourteen billion, six hundred seventy-six million, eight hundred seventy-three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •