Base | Representation |
---|---|
bin | 11001011011001010… |
… | …11101001000011001 |
3 | 1022020021022100210210 |
4 | 30231211131020121 |
5 | 210423310222012 |
6 | 10134240201333 |
7 | 662152331622 |
oct | 145545351031 |
9 | 38207270723 |
10 | 13649695257 |
11 | 5874996090 |
12 | 278b309249 |
13 | 1396b7a073 |
14 | 936b6aa49 |
15 | 54d4d923c |
hex | 32d95d219 |
13649695257 has 32 divisors (see below), whose sum is σ = 20140876800. Its totient is φ = 8153912000.
The previous prime is 13649695237. The next prime is 13649695291. The reversal of 13649695257 is 75259694631.
13649695257 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 13649695257 - 26 = 13649695193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13649695197 and 13649695206.
It is not an unprimeable number, because it can be changed into a prime (13649695217) 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 31 ways as a sum of consecutive naturals, for example, 633532 + ... + 654722.
It is an arithmetic number, because the mean of its divisors is an integer number (629402400).
Almost surely, 213649695257 is an apocalyptic number.
It is an amenable number.
13649695257 is a deficient number, since it is larger than the sum of its proper divisors (6491181543).
13649695257 is a wasteful number, since it uses less digits than its factorization.
13649695257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21485.
The product of its digits is 12247200, while the sum is 57.
The spelling of 13649695257 in words is "thirteen billion, six hundred forty-nine million, six hundred ninety-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •