Base | Representation |
---|---|
bin | 1000010110010100100… |
… | …1110110000101010000 |
3 | 111201012221201202111002 |
4 | 2011211021312011100 |
5 | 4322221314003100 |
6 | 145520304041132 |
7 | 13235232246632 |
oct | 2054511660520 |
9 | 451187652432 |
10 | 143431000400 |
11 | 55913073566 |
12 | 2396a9031a8 |
13 | 106aa65024c |
14 | 6d29188a52 |
15 | 3ae704e2d5 |
hex | 2165276150 |
143431000400 has 120 divisors (see below), whose sum is σ = 350074986624. Its totient is φ = 56461363200.
The previous prime is 143431000397. The next prime is 143431000417. The reversal of 143431000400 is 4000134341.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38134520 + ... + 38138280.
Almost surely, 2143431000400 is an apocalyptic number.
143431000400 is a gapful number since it is divisible by the number (10) 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 143431000400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175037493312).
143431000400 is an abundant number, since it is smaller than the sum of its proper divisors (206643986224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143431000400 is a wasteful number, since it uses less digits than its factorization.
143431000400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5269 (or 5258 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 143431000400 its reverse (4000134341), we get a palindrome (147431134741).
The spelling of 143431000400 in words is "one hundred forty-three billion, four hundred thirty-one million, four hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •