Base | Representation |
---|---|
bin | 100101001011010100011000… |
… | …100011110001001101101011 |
3 | 210102220222022221211210000021 |
4 | 211023110120203301031223 |
5 | 132412333302114134402 |
6 | 1335425222212021311 |
7 | 46303612154623621 |
oct | 4513243043611553 |
9 | 712828287753007 |
10 | 163505522021227 |
11 | 48109336667761 |
12 | 16408570601837 |
13 | 70306736c6179 |
14 | 2c539d0bb1511 |
15 | 13d82493b8d37 |
hex | 94b5188f136b |
163505522021227 has 2 divisors, whose sum is σ = 163505522021228. Its totient is φ = 163505522021226.
The previous prime is 163505522021209. The next prime is 163505522021279. The reversal of 163505522021227 is 722120225505361.
It is a weak prime.
It is an emirp because it is prime and its reverse (722120225505361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 163505522021227 - 223 = 163505513632619 is a prime.
It is not a weakly prime, because it can be changed into another prime (163505522021207) 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, 81752761010613 + 81752761010614.
It is an arithmetic number, because the mean of its divisors is an integer number (81752761010614).
Almost surely, 2163505522021227 is an apocalyptic number.
163505522021227 is a deficient number, since it is larger than the sum of its proper divisors (1).
163505522021227 is an equidigital number, since it uses as much as digits as its factorization.
163505522021227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504000, while the sum is 43.
Adding to 163505522021227 its reverse (722120225505361), we get a palindrome (885625747526588).
The spelling of 163505522021227 in words is "one hundred sixty-three trillion, five hundred five billion, five hundred twenty-two million, twenty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •