Base | Representation |
---|---|
bin | 1100111101000011011011… |
… | …1011000010100111010001 |
3 | 1212102121202110101120010121 |
4 | 3033100312323002213101 |
5 | 3331324212422003101 |
6 | 50143054203430241 |
7 | 3000011430644122 |
oct | 317206673024721 |
9 | 55377673346117 |
10 | 14243033000401 |
11 | 45a14888a4a27 |
12 | 172048ab25381 |
13 | 7c415c7c276a |
14 | 37351b874049 |
15 | 19a76226b0a1 |
hex | cf436ec29d1 |
14243033000401 has 2 divisors, whose sum is σ = 14243033000402. Its totient is φ = 14243033000400.
The previous prime is 14243033000359. The next prime is 14243033000411. The reversal of 14243033000401 is 10400033034241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8588738729025 + 5654294271376 = 2930655^2 + 2377876^2 .
It is a cyclic number.
It is not a de Polignac number, because 14243033000401 - 211 = 14243032998353 is a prime.
It is not a weakly prime, because it can be changed into another prime (14243033000411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7121516500200 + 7121516500201.
It is an arithmetic number, because the mean of its divisors is an integer number (7121516500201).
Almost surely, 214243033000401 is an apocalyptic number.
It is an amenable number.
14243033000401 is a deficient number, since it is larger than the sum of its proper divisors (1).
14243033000401 is an equidigital number, since it uses as much as digits as its factorization.
14243033000401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 14243033000401 its reverse (10400033034241), we get a palindrome (24643066034642).
The spelling of 14243033000401 in words is "fourteen trillion, two hundred forty-three billion, thirty-three million, four hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •