Base | Representation |
---|---|
bin | 11000101000000… |
… | …100010000110000 |
3 | 1001210102112000220 |
4 | 120220010100300 |
5 | 1321232001100 |
6 | 104555213040 |
7 | 13144525416 |
oct | 3050042060 |
9 | 1053375026 |
10 | 413156400 |
11 | 1a2241578 |
12 | b6447180 |
13 | 67799a57 |
14 | 3cc2b2b6 |
15 | 26411aa0 |
hex | 18a04430 |
413156400 has 120 divisors (see below), whose sum is σ = 1334390784. Its totient is φ = 109267200.
The previous prime is 413156377. The next prime is 413156407. The reversal of 413156400 is 4651314.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (413156407) 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, 151045 + ... + 153755.
Almost surely, 2413156400 is an apocalyptic number.
413156400 is a gapful number since it is divisible by the number (40) 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 413156400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (667195392).
413156400 is an abundant number, since it is smaller than the sum of its proper divisors (921234384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413156400 is a wasteful number, since it uses less digits than its factorization.
413156400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2859 (or 2848 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 413156400 is about 20326.2490391120. The cubic root of 413156400 is about 744.7974165030.
The spelling of 413156400 in words is "four hundred thirteen million, one hundred fifty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •