Base | Representation |
---|---|
bin | 100101000100010000010011… |
… | …100000110010100111101001 |
3 | 210101012120101111001111020111 |
4 | 211010100103200302213221 |
5 | 132331410134122100100 |
6 | 1334414223003054321 |
7 | 46223546125142530 |
oct | 4504202340624751 |
9 | 711176344044214 |
10 | 163020106050025 |
11 | 47a41490a37a24 |
12 | 1634a47b8113a1 |
13 | 6cc6964b80443 |
14 | 2c38302851317 |
15 | 13ca7d8cce6ba |
hex | 9444138329e9 |
163020106050025 has 12 divisors (see below), whose sum is σ = 231022778859712. Its totient is φ = 111785215577040.
The previous prime is 163020106050017. The next prime is 163020106050029. The reversal of 163020106050025 is 520050601020361.
It is not a de Polignac number, because 163020106050025 - 23 = 163020106050017 is a prime.
It is a super-2 number, since 2×1630201060500252 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (163020106050029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 465771731397 + ... + 465771731746.
Almost surely, 2163020106050025 is an apocalyptic number.
It is an amenable number.
163020106050025 is a deficient number, since it is larger than the sum of its proper divisors (68002672809687).
163020106050025 is an equidigital number, since it uses as much as digits as its factorization.
163020106050025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 931543463160 (or 931543463155 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 163020106050025 its reverse (520050601020361), we get a palindrome (683070707070386).
The spelling of 163020106050025 in words is "one hundred sixty-three trillion, twenty billion, one hundred six million, fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •