Base | Representation |
---|---|
bin | 10111110111000… |
… | …111111111100110 |
3 | 1000220021200220020 |
4 | 113313013333212 |
5 | 1304440423010 |
6 | 103420220010 |
7 | 12630502014 |
oct | 2767077746 |
9 | 1026250806 |
10 | 400326630 |
11 | 195a79360 |
12 | b209a606 |
13 | 64c27182 |
14 | 3b24b8b4 |
15 | 2522a470 |
hex | 17dc7fe6 |
400326630 has 64 divisors (see below), whose sum is σ = 1058593536. Its totient is φ = 96080000.
The previous prime is 400326629. The next prime is 400326737. The reversal of 400326630 is 36623004.
It is a super-2 number, since 2×4003266302 = 320522821374313800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 400326630.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27325 + ... + 39335.
It is an arithmetic number, because the mean of its divisors is an integer number (16540524).
Almost surely, 2400326630 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 400326630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (529296768).
400326630 is an abundant number, since it is smaller than the sum of its proper divisors (658266906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400326630 is a wasteful number, since it uses less digits than its factorization.
400326630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12133.
The product of its (nonzero) digits is 2592, while the sum is 24.
The square root of 400326630 is about 20008.1640836934. The cubic root of 400326630 is about 737.0067976988.
Adding to 400326630 its reverse (36623004), we get a palindrome (436949634).
The spelling of 400326630 in words is "four hundred million, three hundred twenty-six thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •