Base | Representation |
---|---|
bin | 1011101011010011001… |
… | …01110000001110111100 |
3 | 1102100120120002122000020 |
4 | 11311221211300032330 |
5 | 23033131041304400 |
6 | 504151010332140 |
7 | 40662124111536 |
oct | 5655145601674 |
9 | 1370516078006 |
10 | 401203463100 |
11 | 145170994000 |
12 | 6590a28a050 |
13 | 2baaaa75b9b |
14 | 155bdd54856 |
15 | a6823ba2a0 |
hex | 5d699703bc |
401203463100 has 288 divisors, whose sum is σ = 1279362615552. Its totient is φ = 97067168000.
The previous prime is 401203463077. The next prime is 401203463137. The reversal of 401203463100 is 1364302104.
It is a super-2 number, since 2×4012034631002 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 378136570 + ... + 378137630.
It is an arithmetic number, because the mean of its divisors is an integer number (4442231304).
Almost surely, 2401203463100 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 401203463100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (639681307776).
401203463100 is an abundant number, since it is smaller than the sum of its proper divisors (878159152452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401203463100 is a wasteful number, since it uses less digits than its factorization.
401203463100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2058 (or 2029 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 401203463100 its reverse (1364302104), we get a palindrome (402567765204).
The spelling of 401203463100 in words is "four hundred one billion, two hundred three million, four hundred sixty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •