Base | Representation |
---|---|
bin | 10100110100101111000… |
… | …001100010110011101000 |
3 | 12001210200202111122012002 |
4 | 110310233001202303220 |
5 | 141421203314342212 |
6 | 3013222011510132 |
7 | 205246560113210 |
oct | 24645701426350 |
9 | 5053622448162 |
10 | 1431013043432 |
11 | 5019866138a5 |
12 | 1b140b458348 |
13 | a4c36b2504b |
14 | 4d3933d9240 |
15 | 27355b94ac2 |
hex | 14d2f062ce8 |
1431013043432 has 32 divisors (see below), whose sum is σ = 3066525950400. Its totient is φ = 613277418624.
The previous prime is 1431013043423. The next prime is 1431013043483. The reversal of 1431013043432 is 2343403101341.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1431013043395 and 1431013043404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2432828 + ... + 2963220.
It is an arithmetic number, because the mean of its divisors is an integer number (95828935950).
Almost surely, 21431013043432 is an apocalyptic number.
It is an amenable number.
1431013043432 is an abundant number, since it is smaller than the sum of its proper divisors (1635512906968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1431013043432 is a wasteful number, since it uses less digits than its factorization.
1431013043432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578585 (or 578581 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1431013043432 its reverse (2343403101341), we get a palindrome (3774416144773).
The spelling of 1431013043432 in words is "one trillion, four hundred thirty-one billion, thirteen million, forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •