Base | Representation |
---|---|
bin | 1011101010111110001… |
… | …01010111110000110100 |
3 | 1102100010021102122101001 |
4 | 11311133011113300310 |
5 | 23032300430431400 |
6 | 504121312413044 |
7 | 40654553655220 |
oct | 5653705276064 |
9 | 1370107378331 |
10 | 401027202100 |
11 | 145090445558 |
12 | 6587b247184 |
13 | 2ba803b0b35 |
14 | 155a4791780 |
15 | a671b9ea6a |
hex | 5d5f157c34 |
401027202100 has 72 divisors (see below), whose sum is σ = 995310671040. Its totient is φ = 137389528320.
The previous prime is 401027202097. The next prime is 401027202101. The reversal of 401027202100 is 1202720104.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401027202101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 695736 + ... + 1134064.
It is an arithmetic number, because the mean of its divisors is an integer number (13823759320).
Almost surely, 2401027202100 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 401027202100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (497655335520).
401027202100 is an abundant number, since it is smaller than the sum of its proper divisors (594283468940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401027202100 is a wasteful number, since it uses less digits than its factorization.
401027202100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439657 (or 439650 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 19.
Adding to 401027202100 its reverse (1202720104), we get a palindrome (402229922204).
The spelling of 401027202100 in words is "four hundred one billion, twenty-seven million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •