Base | Representation |
---|---|
bin | 10100110100110000110… |
… | …101011110011010001000 |
3 | 12001210202212200122101010 |
4 | 110310300311132122020 |
5 | 141421234104342440 |
6 | 3013225015123520 |
7 | 205250406326616 |
oct | 24646065363210 |
9 | 5053685618333 |
10 | 1431043434120 |
11 | 5019a1790873 |
12 | 1b14196735a0 |
13 | a4c40205ac1 |
14 | 4d39746a6b6 |
15 | 27358699580 |
hex | 14d30d5e688 |
1431043434120 has 128 divisors (see below), whose sum is σ = 4546146124800. Its totient is φ = 359361835776.
The previous prime is 1431043434059. The next prime is 1431043434133. The reversal of 1431043434120 is 214343401341.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 31 ways as a sum of consecutive naturals, for example, 1498434 + ... + 2259953.
It is an arithmetic number, because the mean of its divisors is an integer number (35516766600).
Almost surely, 21431043434120 is an apocalyptic number.
1431043434120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1431043434120 is an abundant number, since it is smaller than the sum of its proper divisors (3115102690680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1431043434120 is a wasteful number, since it uses less digits than its factorization.
1431043434120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3758587 (or 3758583 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 1431043434120 its reverse (214343401341), we get a palindrome (1645386835461).
The spelling of 1431043434120 in words is "one trillion, four hundred thirty-one billion, forty-three million, four hundred thirty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •