Base | Representation |
---|---|
bin | 10111111010000… |
… | …101100100000100 |
3 | 1000221202011000200 |
4 | 113322011210010 |
5 | 1310140244413 |
6 | 103445010500 |
7 | 12640214550 |
oct | 2772054404 |
9 | 1027664020 |
10 | 401103108 |
11 | 19645977a |
12 | b23b3a30 |
13 | 65139723 |
14 | 3b3b0860 |
15 | 25330573 |
hex | 17e85904 |
401103108 has 72 divisors (see below), whose sum is σ = 1162167552. Its totient is φ = 114262272.
The previous prime is 401103103. The next prime is 401103127. The reversal of 401103108 is 801301104.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (401103103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 90316 + ... + 94652.
It is an arithmetic number, because the mean of its divisors is an integer number (16141216).
Almost surely, 2401103108 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 401103108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (581083776).
401103108 is an abundant number, since it is smaller than the sum of its proper divisors (761064444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401103108 is a wasteful number, since it uses less digits than its factorization.
401103108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4721 (or 4716 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 401103108 is about 20027.5587129335. The cubic root of 401103108 is about 737.4829921578.
The spelling of 401103108 in words is "four hundred one million, one hundred three thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •