Base | Representation |
---|---|
bin | 1001001001100011001110… |
… | …01001111010011000100011 |
3 | 2122020101120121121000102002 |
4 | 10210301213021322120203 |
5 | 10114113421002404042 |
6 | 110442412154514215 |
7 | 4144401301524512 |
oct | 444614711723043 |
9 | 78211517530362 |
10 | 20119357466147 |
11 | 6457631862a45 |
12 | 230b32413596b |
13 | b2c32a32c554 |
14 | 4d7ad4108679 |
15 | 24d53d71b132 |
hex | 124c6727a623 |
20119357466147 has 2 divisors, whose sum is σ = 20119357466148. Its totient is φ = 20119357466146.
The previous prime is 20119357466059. The next prime is 20119357466227. The reversal of 20119357466147 is 74166475391102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20119357466147 - 212 = 20119357462051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20119357466092 and 20119357466101.
It is not a weakly prime, because it can be changed into another prime (20119357466647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10059678733073 + 10059678733074.
It is an arithmetic number, because the mean of its divisors is an integer number (10059678733074).
Almost surely, 220119357466147 is an apocalyptic number.
20119357466147 is a deficient number, since it is larger than the sum of its proper divisors (1).
20119357466147 is an equidigital number, since it uses as much as digits as its factorization.
20119357466147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7620480, while the sum is 56.
The spelling of 20119357466147 in words is "twenty trillion, one hundred nineteen billion, three hundred fifty-seven million, four hundred sixty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •