Base | Representation |
---|---|
bin | 1001001001111101001000… |
… | …00011011110110100110011 |
3 | 2122021201110210100211101011 |
4 | 10210332210003132310303 |
5 | 10114330411101424332 |
6 | 110453032134051351 |
7 | 4145403024066541 |
oct | 444764403366463 |
9 | 78251423324334 |
10 | 20133264092467 |
11 | 6462518786149 |
12 | 2311b654a9b57 |
13 | b307354a7a16 |
14 | 4d8653036d91 |
15 | 24daa4557e47 |
hex | 124fa40ded33 |
20133264092467 has 2 divisors, whose sum is σ = 20133264092468. Its totient is φ = 20133264092466.
The previous prime is 20133264092429. The next prime is 20133264092471. The reversal of 20133264092467 is 76429046233102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20133264092467 - 235 = 20098904354099 is a prime.
It is a super-2 number, since 2×201332640924672 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20133264092467.
It is not a weakly prime, because it can be changed into another prime (20133264092477) 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, 10066632046233 + 10066632046234.
It is an arithmetic number, because the mean of its divisors is an integer number (10066632046234).
Almost surely, 220133264092467 is an apocalyptic number.
20133264092467 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133264092467 is an equidigital number, since it uses as much as digits as its factorization.
20133264092467 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 49.
The spelling of 20133264092467 in words is "twenty trillion, one hundred thirty-three billion, two hundred sixty-four million, ninety-two thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •