Base | Representation |
---|---|
bin | 1001100000001110011… |
… | …0000001100111110011 |
3 | 120121102111112110011112 |
4 | 2120003212001213303 |
5 | 10133333334311021 |
6 | 203001010303535 |
7 | 14536650041444 |
oct | 2300346014763 |
9 | 517374473145 |
10 | 163269057011 |
11 | 63273143075 |
12 | 27786587bab |
13 | 1251c606998 |
14 | 7c8bb572cb |
15 | 43a897bd5b |
hex | 26039819f3 |
163269057011 has 2 divisors, whose sum is σ = 163269057012. Its totient is φ = 163269057010.
The previous prime is 163269056957. The next prime is 163269057041. The reversal of 163269057011 is 110750962361.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-163269057011 is a prime.
It is a super-2 number, since 2×1632690570112 (a number of 23 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 163269057011.
It is not a weakly prime, because it can be changed into another prime (163269057041) 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, 81634528505 + 81634528506.
It is an arithmetic number, because the mean of its divisors is an integer number (81634528506).
Almost surely, 2163269057011 is an apocalyptic number.
163269057011 is a deficient number, since it is larger than the sum of its proper divisors (1).
163269057011 is an equidigital number, since it uses as much as digits as its factorization.
163269057011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 163269057011 in words is "one hundred sixty-three billion, two hundred sixty-nine million, fifty-seven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •