Base | Representation |
---|---|
bin | 11010111100110101… |
… | …01001110100000001 |
3 | 1101100100212200012101 |
4 | 31132122221310001 |
5 | 214113022302301 |
6 | 10351423430401 |
7 | 1021361010352 |
oct | 153632516401 |
9 | 41310780171 |
10 | 14468947201 |
11 | 6155386205 |
12 | 2979755401 |
13 | 1497810a27 |
14 | 9b38a7d29 |
15 | 59a3b5701 |
hex | 35e6a9d01 |
14468947201 has 2 divisors, whose sum is σ = 14468947202. Its totient is φ = 14468947200.
The previous prime is 14468947189. The next prime is 14468947211. The reversal of 14468947201 is 10274986441.
14468947201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13380936976 + 1088010225 = 115676^2 + 32985^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14468947201 is a prime.
It is not a weakly prime, because it can be changed into another prime (14468947211) 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 as a sum of consecutive naturals, namely, 7234473600 + 7234473601.
It is an arithmetic number, because the mean of its divisors is an integer number (7234473601).
Almost surely, 214468947201 is an apocalyptic number.
It is an amenable number.
14468947201 is a deficient number, since it is larger than the sum of its proper divisors (1).
14468947201 is an equidigital number, since it uses as much as digits as its factorization.
14468947201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 387072, while the sum is 46.
It can be divided in two parts, 144689 and 47201, that added together give a triangular number (191890 = T619).
The spelling of 14468947201 in words is "fourteen billion, four hundred sixty-eight million, nine hundred forty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •