Base | Representation |
---|---|
bin | 11001000010101010… |
… | …11100001000111101 |
3 | 1021200221120121120101 |
4 | 30201111130020331 |
5 | 210013201422201 |
6 | 10102015121101 |
7 | 654105363532 |
oct | 144125341075 |
9 | 37627517511 |
10 | 13444170301 |
11 | 577997a151 |
12 | 2732513191 |
13 | 136340a073 |
14 | 91774ad89 |
15 | 53a43cd01 |
hex | 32155c23d |
13444170301 has 2 divisors, whose sum is σ = 13444170302. Its totient is φ = 13444170300.
The previous prime is 13444170263. The next prime is 13444170329. The reversal of 13444170301 is 10307144431.
It is an a-pointer prime, because the next prime (13444170329) can be obtained adding 13444170301 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12505054276 + 939116025 = 111826^2 + 30645^2 .
It is an emirp because it is prime and its reverse (10307144431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13444170301 - 215 = 13444137533 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13444170301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13444170361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6722085150 + 6722085151.
It is an arithmetic number, because the mean of its divisors is an integer number (6722085151).
Almost surely, 213444170301 is an apocalyptic number.
It is an amenable number.
13444170301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13444170301 is an equidigital number, since it uses as much as digits as its factorization.
13444170301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 28.
The spelling of 13444170301 in words is "thirteen billion, four hundred forty-four million, one hundred seventy thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •