Base | Representation |
---|---|
bin | 1001011111101110100… |
… | …0010001000111001101 |
3 | 120121002012002100021122 |
4 | 2113323220101013031 |
5 | 10133100132131041 |
6 | 202535434210325 |
7 | 14533435151600 |
oct | 2277350210715 |
9 | 517065070248 |
10 | 163135427021 |
11 | 63204771966 |
12 | 277498839a5 |
13 | 124caa19b98 |
14 | 7c780d0337 |
15 | 439bd82c4b |
hex | 25fba111cd |
163135427021 has 24 divisors (see below), whose sum is σ = 193595317560. Its totient is φ = 137035971072.
The previous prime is 163135427017. The next prime is 163135427023. The reversal of 163135427021 is 120724531361.
It can be written as a sum of positive squares in 4 ways, for example, as 46573956100 + 116561470921 = 215810^2 + 341411^2 .
It is not a de Polignac number, because 163135427021 - 22 = 163135427017 is a prime.
It is a super-2 number, since 2×1631354270212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163135427023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 416345 + ... + 706833.
It is an arithmetic number, because the mean of its divisors is an integer number (8066471565).
Almost surely, 2163135427021 is an apocalyptic number.
It is an amenable number.
163135427021 is a deficient number, since it is larger than the sum of its proper divisors (30459890539).
163135427021 is a wasteful number, since it uses less digits than its factorization.
163135427021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290733 (or 290726 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 35.
Adding to 163135427021 its reverse (120724531361), we get a palindrome (283859958382).
The spelling of 163135427021 in words is "one hundred sixty-three billion, one hundred thirty-five million, four hundred twenty-seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •