Base | Representation |
---|---|
bin | 100101001011010011000000… |
… | …110100011110000100100101 |
3 | 210102220211112100222120100101 |
4 | 211023103000310132010211 |
5 | 132412322243300114021 |
6 | 1335424420145344101 |
7 | 46303530531654151 |
oct | 4513230064360445 |
9 | 712824470876311 |
10 | 163504050004261 |
11 | 4810875075a60a |
12 | 1640821b638031 |
13 | 703049a750b05 |
14 | 2c538d14b4061 |
15 | 13d81b004aa91 |
hex | 94b4c0d1e125 |
163504050004261 has 16 divisors (see below), whose sum is σ = 163888678024000. Its totient is φ = 163119897819648.
The previous prime is 163504050004181. The next prime is 163504050004271. The reversal of 163504050004261 is 162400050405361.
It is a cyclic number.
It is not a de Polignac number, because 163504050004261 - 231 = 163501902520613 is a prime.
It is a super-2 number, since 2×1635040500042612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 163504050004261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163504050004271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4604562775 + ... + 4604598283.
It is an arithmetic number, because the mean of its divisors is an integer number (10243042376500).
Almost surely, 2163504050004261 is an apocalyptic number.
It is an amenable number.
163504050004261 is a deficient number, since it is larger than the sum of its proper divisors (384628019739).
163504050004261 is a wasteful number, since it uses less digits than its factorization.
163504050004261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41908.
The product of its (nonzero) digits is 86400, while the sum is 37.
The spelling of 163504050004261 in words is "one hundred sixty-three trillion, five hundred four billion, fifty million, four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •