Base | Representation |
---|---|
bin | 101111010100000110… |
… | …0100011010100101010 |
3 | 100201021002211012200000 |
4 | 1132220030203110222 |
5 | 3131042131014011 |
6 | 114402135323430 |
7 | 10224615455265 |
oct | 1365014432452 |
9 | 321232735600 |
10 | 101606110506 |
11 | 3a10000075a |
12 | 17837820576 |
13 | 97734a48a4 |
14 | 4cbc4a5cdc |
15 | 299a244356 |
hex | 17a832352a |
101606110506 has 24 divisors (see below), whose sum is σ = 228300150624. Its totient is φ = 33868703340.
The previous prime is 101606110433. The next prime is 101606110511. The reversal of 101606110506 is 605011606101.
101606110506 is a `hidden beast` number, since 1 + 0 + 1 + 606 + 1 + 1 + 0 + 50 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 101606110506.
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 11 ways as a sum of consecutive naturals, for example, 104532550 + ... + 104533521.
It is an arithmetic number, because the mean of its divisors is an integer number (9512506276).
Almost surely, 2101606110506 is an apocalyptic number.
101606110506 is an abundant number, since it is smaller than the sum of its proper divisors (126694040118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101606110506 is an equidigital number, since it uses as much as digits as its factorization.
101606110506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209066088 (or 209066076 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
Adding to 101606110506 its reverse (605011606101), we get a palindrome (706617716607).
The spelling of 101606110506 in words is "one hundred one billion, six hundred six million, one hundred ten thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •