Base | Representation |
---|---|
bin | 1100111011111101101010… |
… | …0110111000000000001001 |
3 | 1212100211102020010002022202 |
4 | 3032333122212320000021 |
5 | 3331022333402403001 |
6 | 50130315531325545 |
7 | 2665446343654436 |
oct | 316773246700011 |
9 | 55324366102282 |
10 | 14224304341001 |
11 | 4594547a78a17 |
12 | 17189228b08b5 |
13 | 7c246662a091 |
14 | 37266236cb8d |
15 | 19a017e2d96b |
hex | cefda9b8009 |
14224304341001 has 2 divisors, whose sum is σ = 14224304341002. Its totient is φ = 14224304341000.
The previous prime is 14224304340997. The next prime is 14224304341007. The reversal of 14224304341001 is 10014340342241.
14224304341001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13392496499776 + 831807841225 = 3659576^2 + 912035^2 .
It is a cyclic number.
It is not a de Polignac number, because 14224304341001 - 22 = 14224304340997 is a prime.
It is not a weakly prime, because it can be changed into another prime (14224304341007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7112152170500 + 7112152170501.
It is an arithmetic number, because the mean of its divisors is an integer number (7112152170501).
Almost surely, 214224304341001 is an apocalyptic number.
It is an amenable number.
14224304341001 is a deficient number, since it is larger than the sum of its proper divisors (1).
14224304341001 is an equidigital number, since it uses as much as digits as its factorization.
14224304341001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 14224304341001 its reverse (10014340342241), we get a palindrome (24238644683242).
The spelling of 14224304341001 in words is "fourteen trillion, two hundred twenty-four billion, three hundred four million, three hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •