Base | Representation |
---|---|
bin | 11001101101111010… |
… | …01000110101000001 |
3 | 1022122020010010010000 |
4 | 30312331020311001 |
5 | 211234031222442 |
6 | 10202013430213 |
7 | 666101462250 |
oct | 146675106501 |
9 | 38566103100 |
10 | 13806898497 |
11 | 59456a8217 |
12 | 2813a9b369 |
13 | 13c05cb832 |
14 | 94d9ac797 |
15 | 55c1dcd4c |
hex | 336f48d41 |
13806898497 has 40 divisors (see below), whose sum is σ = 23743754496. Its totient is φ = 7832023488.
The previous prime is 13806898487. The next prime is 13806898583. The reversal of 13806898497 is 79489860831.
13806898497 is a `hidden beast` number, since 1 + 3 + 80 + 68 + 9 + 8 + 497 = 666.
13806898497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13806898497 - 24 = 13806898481 is a prime.
It is a super-2 number, since 2×138068984972 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (13806898487) 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 39 ways as a sum of consecutive naturals, for example, 11193 + ... + 166550.
Almost surely, 213806898497 is an apocalyptic number.
It is an amenable number.
13806898497 is a deficient number, since it is larger than the sum of its proper divisors (9936855999).
13806898497 is a wasteful number, since it uses less digits than its factorization.
13806898497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177899 (or 177890 counting only the distinct ones).
The product of its (nonzero) digits is 20901888, while the sum is 63.
The spelling of 13806898497 in words is "thirteen billion, eight hundred six million, eight hundred ninety-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •