Base | Representation |
---|---|
bin | 11001000101010001… |
… | …01110001111100011 |
3 | 1021202110122210120202 |
4 | 30202220232033203 |
5 | 210034244034103 |
6 | 10104115055415 |
7 | 654462063140 |
oct | 144250561743 |
9 | 37673583522 |
10 | 13466002403 |
11 | 5790230a07 |
12 | 27398a156b |
13 | 1367ab2379 |
14 | 91a5d13c7 |
15 | 53c301988 |
hex | 322a2e3e3 |
13466002403 has 16 divisors (see below), whose sum is σ = 15835846656. Its totient is φ = 11210218560.
The previous prime is 13466002391. The next prime is 13466002453. The reversal of 13466002403 is 30420066431.
13466002403 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 13466002403 - 26 = 13466002339 is a prime.
It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (13466002453) 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, 41201 + ... + 169202.
It is an arithmetic number, because the mean of its divisors is an integer number (989740416).
Almost surely, 213466002403 is an apocalyptic number.
13466002403 is a deficient number, since it is larger than the sum of its proper divisors (2369844253).
13466002403 is a wasteful number, since it uses less digits than its factorization.
13466002403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210674.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 13466002403 its reverse (30420066431), we get a palindrome (43886068834).
The spelling of 13466002403 in words is "thirteen billion, four hundred sixty-six million, two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •