Base | Representation |
---|---|
bin | 110001101011… |
… | …010011000001 |
3 | 220111121101011 |
4 | 301223103001 |
5 | 11313204101 |
6 | 1143040521 |
7 | 215455120 |
oct | 61532301 |
9 | 26447334 |
10 | 13022401 |
11 | 7394a17 |
12 | 4440141 |
13 | 290c482 |
14 | 1a2dab7 |
15 | 1223751 |
hex | c6b4c1 |
13022401 has 4 divisors (see below), whose sum is σ = 14882752. Its totient is φ = 11162052.
The previous prime is 13022389. The next prime is 13022413. The reversal of 13022401 is 10422031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (13022389) and next prime (13022413).
It is a cyclic number.
It is not a de Polignac number, because 13022401 - 25 = 13022369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13022441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 930165 + ... + 930178.
It is an arithmetic number, because the mean of its divisors is an integer number (3720688).
Almost surely, 213022401 is an apocalyptic number.
It is an amenable number.
13022401 is a deficient number, since it is larger than the sum of its proper divisors (1860351).
13022401 is an equidigital number, since it uses as much as digits as its factorization.
13022401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1860350.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 13022401 is about 3608.6563981626. The cubic root of 13022401 is about 235.2684483186.
Adding to 13022401 its reverse (10422031), we get a palindrome (23444432).
The spelling of 13022401 in words is "thirteen million, twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •