Base | Representation |
---|---|
bin | 1011101011011110101… |
… | …10110010110111001000 |
3 | 1102100211022010121221120 |
4 | 11311233112302313020 |
5 | 23033330323030000 |
6 | 504204344035240 |
7 | 40664410314102 |
oct | 5655726626710 |
9 | 1370738117846 |
10 | 401300205000 |
11 | 14521055a692 |
12 | 65936762b20 |
13 | 2bac4b18706 |
14 | 155ccb38572 |
15 | a68ab296a0 |
hex | 5d6f5b2dc8 |
401300205000 has 160 divisors (see below), whose sum is σ = 1308170001600. Its totient is φ = 102360544000.
The previous prime is 401300204947. The next prime is 401300205017. The reversal of 401300205000 is 502003104.
It is a super-2 number, since 2×4013002050002 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 236595 + ... + 926594.
It is an arithmetic number, because the mean of its divisors is an integer number (8176062510).
Almost surely, 2401300205000 is an apocalyptic number.
401300205000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
401300205000 is an abundant number, since it is smaller than the sum of its proper divisors (906869796600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401300205000 is a wasteful number, since it uses less digits than its factorization.
401300205000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163241 (or 1163222 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
Adding to 401300205000 its reverse (502003104), we get a palindrome (401802208104).
The spelling of 401300205000 in words is "four hundred one billion, three hundred million, two hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •