Base | Representation |
---|---|
bin | 10010110000111110… |
… | …001010011101010001 |
3 | 1221000012210222001011 |
4 | 102300332022131101 |
5 | 312231113024321 |
6 | 13131210010521 |
7 | 1312211201632 |
oct | 226076123521 |
9 | 57005728034 |
10 | 20148954961 |
11 | 85aa6180a3 |
12 | 3aa3a16a41 |
13 | 1b914cbc75 |
14 | d91dbb889 |
15 | 7cdd90ae1 |
hex | 4b0f8a751 |
20148954961 has 2 divisors, whose sum is σ = 20148954962. Its totient is φ = 20148954960.
The previous prime is 20148954953. The next prime is 20148954967. The reversal of 20148954961 is 16945984102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20141002561 + 7952400 = 141919^2 + 2820^2 .
It is a cyclic number.
It is not a de Polignac number, because 20148954961 - 23 = 20148954953 is a prime.
It is not a weakly prime, because it can be changed into another prime (20148954967) 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, 10074477480 + 10074477481.
It is an arithmetic number, because the mean of its divisors is an integer number (10074477481).
Almost surely, 220148954961 is an apocalyptic number.
It is an amenable number.
20148954961 is a deficient number, since it is larger than the sum of its proper divisors (1).
20148954961 is an equidigital number, since it uses as much as digits as its factorization.
20148954961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 49.
The spelling of 20148954961 in words is "twenty billion, one hundred forty-eight million, nine hundred fifty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •