Base | Representation |
---|---|
bin | 1100110000001100011010… |
… | …0011010100000101001010 |
3 | 1211122111111120020211101111 |
4 | 3030003012203110011022 |
5 | 3314214232211301302 |
6 | 45453355453040534 |
7 | 2645030550556033 |
oct | 314030643240512 |
9 | 54574446224344 |
10 | 14022104400202 |
11 | 4516817418728 |
12 | 16a56b248614a |
13 | 7a93815ca4b2 |
14 | 366960027a8a |
15 | 194b317a00d7 |
hex | cc0c68d414a |
14022104400202 has 4 divisors (see below), whose sum is σ = 21033156600306. Its totient is φ = 7011052200100.
The previous prime is 14022104400179. The next prime is 14022104400209. The reversal of 14022104400202 is 20200440122041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 13854095407881 + 168008992321 = 3722109^2 + 409889^2 .
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (14022104400209) 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, 3505526100049 + ... + 3505526100052.
Almost surely, 214022104400202 is an apocalyptic number.
14022104400202 is a deficient number, since it is larger than the sum of its proper divisors (7011052200104).
14022104400202 is an equidigital number, since it uses as much as digits as its factorization.
14022104400202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7011052200103.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 14022104400202 its reverse (20200440122041), we get a palindrome (34222544522243).
The spelling of 14022104400202 in words is "fourteen trillion, twenty-two billion, one hundred four million, four hundred thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •