Base | Representation |
---|---|
bin | 11001000010010100… |
… | …11111111110000001 |
3 | 1021200202011220112212 |
4 | 30201022133332001 |
5 | 210011433134101 |
6 | 10101433431505 |
7 | 654042120362 |
oct | 144112377601 |
9 | 37622156485 |
10 | 13441302401 |
11 | 57782a048a |
12 | 273156b595 |
13 | 1362944897 |
14 | 917201b69 |
15 | 53a0731bb |
hex | 32129ff81 |
13441302401 has 16 divisors (see below), whose sum is σ = 13618298880. Its totient is φ = 13265920080.
The previous prime is 13441302397. The next prime is 13441302403. The reversal of 13441302401 is 10420314431.
13441302401 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 13441302401 - 22 = 13441302397 is a prime.
It is a super-2 number, since 2×134413024012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13441302403) 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, 23874146 + ... + 23874708.
It is an arithmetic number, because the mean of its divisors is an integer number (851143680).
Almost surely, 213441302401 is an apocalyptic number.
It is an amenable number.
13441302401 is a deficient number, since it is larger than the sum of its proper divisors (176996479).
13441302401 is a wasteful number, since it uses less digits than its factorization.
13441302401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1516.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13441302401 its reverse (10420314431), we get a palindrome (23861616832).
The spelling of 13441302401 in words is "thirteen billion, four hundred forty-one million, three hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •