Base | Representation |
---|---|
bin | 1001100000010110000… |
… | …1000010101110000101 |
3 | 120121111202012211101200 |
4 | 2120011201002232011 |
5 | 10133420113231341 |
6 | 203004121413113 |
7 | 14540521122525 |
oct | 2300541025605 |
9 | 517452184350 |
10 | 163301305221 |
11 | 6328a36968a |
12 | 2779533a199 |
13 | 125261b8072 |
14 | 7c9214d685 |
15 | 43ab6ebdb6 |
hex | 2605842b85 |
163301305221 has 6 divisors (see below), whose sum is σ = 235879663110. Its totient is φ = 108867536808.
The previous prime is 163301305207. The next prime is 163301305231. The reversal of 163301305221 is 122503103361.
163301305221 is a `hidden beast` number, since 1 + 6 + 3 + 3 + 0 + 130 + 522 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 163272564900 + 28740321 = 404070^2 + 5361^2 .
It is not a de Polignac number, because 163301305221 - 210 = 163301304197 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163301305231) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 9072294726 + ... + 9072294743.
It is an arithmetic number, because the mean of its divisors is an integer number (39313277185).
Almost surely, 2163301305221 is an apocalyptic number.
It is an amenable number.
163301305221 is a deficient number, since it is larger than the sum of its proper divisors (72578357889).
163301305221 is a wasteful number, since it uses less digits than its factorization.
163301305221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18144589475 (or 18144589472 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 163301305221 its reverse (122503103361), we get a palindrome (285804408582).
The spelling of 163301305221 in words is "one hundred sixty-three billion, three hundred one million, three hundred five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •