Base | Representation |
---|---|
bin | 1001000110100001000011… |
… | …01110001001000101101101 |
3 | 2121212102111122212220011211 |
4 | 10203100201232021011231 |
5 | 10110411423003441331 |
6 | 110322452141314421 |
7 | 4134021111226234 |
oct | 443204156110555 |
9 | 77772448786154 |
10 | 20015113343341 |
11 | 64173a8764636 |
12 | 22b3090b65a11 |
13 | b22556465b4c |
14 | 4d2a45547b1b |
15 | 24a98bad88b1 |
hex | 123421b8916d |
20015113343341 has 2 divisors, whose sum is σ = 20015113343342. Its totient is φ = 20015113343340.
The previous prime is 20015113343321. The next prime is 20015113343383. The reversal of 20015113343341 is 14334331151002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19368140855625 + 646972487716 = 4400925^2 + 804346^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20015113343341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20015113343321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10007556671670 + 10007556671671.
It is an arithmetic number, because the mean of its divisors is an integer number (10007556671671).
Almost surely, 220015113343341 is an apocalyptic number.
It is an amenable number.
20015113343341 is a deficient number, since it is larger than the sum of its proper divisors (1).
20015113343341 is an equidigital number, since it uses as much as digits as its factorization.
20015113343341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 20015113343341 its reverse (14334331151002), we get a palindrome (34349444494343).
The spelling of 20015113343341 in words is "twenty trillion, fifteen billion, one hundred thirteen million, three hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •