Base | Representation |
---|---|
bin | 11001000011110001… |
… | …01010000100100001 |
3 | 1021201120221122122000 |
4 | 30201320222010201 |
5 | 210023032334101 |
6 | 10102545034213 |
7 | 654250014345 |
oct | 144170520441 |
9 | 37646848560 |
10 | 13453402401 |
11 | 578410538a |
12 | 2735625969 |
13 | 13652c024a |
14 | 918a71625 |
15 | 53b163486 |
hex | 321e2a121 |
13453402401 has 8 divisors (see below), whose sum is σ = 19930966560. Its totient is φ = 8968934916.
The previous prime is 13453402399. The next prime is 13453402423. The reversal of 13453402401 is 10420435431.
It is a happy number.
It is not a de Polignac number, because 13453402401 - 21 = 13453402399 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 498274163 = 13453402401 / (1 + 3 + 4 + 5 + 3 + 4 + 0 + 2 + 4 + 0 + 1).
It is not an unprimeable number, because it can be changed into a prime (13453402471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 249137055 + ... + 249137108.
It is an arithmetic number, because the mean of its divisors is an integer number (2491370820).
Almost surely, 213453402401 is an apocalyptic number.
It is an amenable number.
13453402401 is a deficient number, since it is larger than the sum of its proper divisors (6477564159).
13453402401 is an equidigital number, since it uses as much as digits as its factorization.
13453402401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498274172 (or 498274166 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 13453402401 its reverse (10420435431), we get a palindrome (23873837832).
The spelling of 13453402401 in words is "thirteen billion, four hundred fifty-three million, four hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •