Base | Representation |
---|---|
bin | 1001010010001011000011… |
… | …10001000101010000110001 |
3 | 2200021201021122110122220211 |
4 | 10221011201301011100301 |
5 | 10133442142133030244 |
6 | 111230450053104121 |
7 | 4204660043115346 |
oct | 451054161052061 |
9 | 80251248418824 |
10 | 20415619814449 |
11 | 65612411731a2 |
12 | 2358825928041 |
13 | b512529b3822 |
14 | 50819aaa87cd |
15 | 2560ccbc7934 |
hex | 129161c45431 |
20415619814449 has 2 divisors, whose sum is σ = 20415619814450. Its totient is φ = 20415619814448.
The previous prime is 20415619814417. The next prime is 20415619814509. The reversal of 20415619814449 is 94441891651402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10511179989025 + 9904439825424 = 3242095^2 + 3147132^2 .
It is a cyclic number.
It is not a de Polignac number, because 20415619814449 - 25 = 20415619814417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20415619814393 and 20415619814402.
It is not a weakly prime, because it can be changed into another prime (20415619814749) 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, 10207809907224 + 10207809907225.
It is an arithmetic number, because the mean of its divisors is an integer number (10207809907225).
Almost surely, 220415619814449 is an apocalyptic number.
It is an amenable number.
20415619814449 is a deficient number, since it is larger than the sum of its proper divisors (1).
20415619814449 is an equidigital number, since it uses as much as digits as its factorization.
20415619814449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9953280, while the sum is 58.
The spelling of 20415619814449 in words is "twenty trillion, four hundred fifteen billion, six hundred nineteen million, eight hundred fourteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •