Base | Representation |
---|---|
bin | 1011101011001000001… |
… | …01011101010111000000 |
3 | 1102100100010022122212221 |
4 | 11311210011131113000 |
5 | 23032433421023404 |
6 | 504133511100424 |
7 | 40656623121664 |
oct | 5654405352700 |
9 | 1370303278787 |
10 | 401111111104 |
11 | 145123846640 |
12 | 658a3371714 |
13 | 2ba948ac532 |
14 | 155b19948a4 |
15 | a679226954 |
hex | 5d6415d5c0 |
401111111104 has 112 divisors (see below), whose sum is σ = 872264448000. Its totient is φ = 181495987200.
The previous prime is 401111111083. The next prime is 401111111129.
401111111104 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167198097 + ... + 167200495.
Almost surely, 2401111111104 is an apocalyptic number.
401111111104 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 401111111104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (436132224000).
401111111104 is an abundant number, since it is smaller than the sum of its proper divisors (471153336896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401111111104 is a wasteful number, since it uses less digits than its factorization.
401111111104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3402 (or 3392 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
It can be divided in two parts, 401111 and 111104, that added together give a palindrome (512215).
The spelling of 401111111104 in words is "four hundred one billion, one hundred eleven million, one hundred eleven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •