Base | Representation |
---|---|
bin | 11000001001011… |
… | …000100100001100 |
3 | 1001020021212200220 |
4 | 120021120210030 |
5 | 1312202104400 |
6 | 104110551340 |
7 | 13016255520 |
oct | 3011304414 |
9 | 1036255626 |
10 | 405113100 |
11 | 198748517 |
12 | b3808550 |
13 | 65c119c2 |
14 | 3bb35d80 |
15 | 258737a0 |
hex | 1825890c |
405113100 has 144 divisors (see below), whose sum is σ = 1345747200. Its totient is φ = 92171520.
The previous prime is 405113089. The next prime is 405113141. The reversal of 405113100 is 1311504.
It is a super-2 number, since 2×4051131002 = 328233247583220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 405113100.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 795646 + ... + 796154.
Almost surely, 2405113100 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 405113100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (672873600).
405113100 is an abundant number, since it is smaller than the sum of its proper divisors (940634100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405113100 is a wasteful number, since it uses less digits than its factorization.
405113100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 912 (or 905 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 405113100 is about 20127.4215934381. The cubic root of 405113100 is about 739.9324871449.
Adding to 405113100 its reverse (1311504), we get a palindrome (406424604).
The spelling of 405113100 in words is "four hundred five million, one hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •