Base | Representation |
---|---|
bin | 1001001010010011100100… |
… | …10010011110001111111001 |
3 | 2122022212120120111202220011 |
4 | 10211021302102132033321 |
5 | 10120030100400011403 |
6 | 110502343550501521 |
7 | 4146310443130153 |
oct | 445116222361771 |
9 | 78285516452804 |
10 | 20145314063353 |
11 | 6467641668676 |
12 | 2314368b048a1 |
13 | b31905ab75cb |
14 | 4d9077541ad3 |
15 | 24e05c399a6d |
hex | 12527249e3f9 |
20145314063353 has 2 divisors, whose sum is σ = 20145314063354. Its totient is φ = 20145314063352.
The previous prime is 20145314063297. The next prime is 20145314063447. The reversal of 20145314063353 is 35336041354102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15538315445689 + 4606998617664 = 3941867^2 + 2146392^2 .
It is a cyclic number.
It is not a de Polignac number, because 20145314063353 - 241 = 17946290807801 is a prime.
It is a super-2 number, since 2×201453140633532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20145314033353) 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, 10072657031676 + 10072657031677.
It is an arithmetic number, because the mean of its divisors is an integer number (10072657031677).
Almost surely, 220145314063353 is an apocalyptic number.
It is an amenable number.
20145314063353 is a deficient number, since it is larger than the sum of its proper divisors (1).
20145314063353 is an equidigital number, since it uses as much as digits as its factorization.
20145314063353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 40.
The spelling of 20145314063353 in words is "twenty trillion, one hundred forty-five billion, three hundred fourteen million, sixty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •