Base | Representation |
---|---|
bin | 100101001010100001000000… |
… | …000011101000010100111010 |
3 | 210102201200220221011021222010 |
4 | 211022201000003220110322 |
5 | 132410432304112010020 |
6 | 1335344015414310350 |
7 | 46266620022254535 |
oct | 4512410003502472 |
9 | 712650827137863 |
10 | 163450350110010 |
11 | 480979a454a217 |
12 | 163b99336583b6 |
13 | 70283c02c6662 |
14 | 2c5107962da1c |
15 | 13d6aba960de0 |
hex | 94a8400e853a |
163450350110010 has 64 divisors (see below), whose sum is σ = 412935840345600. Its totient is φ = 41291856021312.
The previous prime is 163450350109939. The next prime is 163450350110027. The reversal of 163450350110010 is 10011053054361.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 163450350110010.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 24486097 + ... + 30437963.
It is an arithmetic number, because the mean of its divisors is an integer number (6452122505400).
Almost surely, 2163450350110010 is an apocalyptic number.
163450350110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
163450350110010 is an abundant number, since it is smaller than the sum of its proper divisors (249485490235590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163450350110010 is a wasteful number, since it uses less digits than its factorization.
163450350110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6000075.
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 163450350110010 in words is "one hundred sixty-three trillion, four hundred fifty billion, three hundred fifty million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •