Base | Representation |
---|---|
bin | 10100110100110110101… |
… | …010011011000011111000 |
3 | 12001211000200122200010002 |
4 | 110310312222123003320 |
5 | 141421434121400440 |
6 | 3013242430412132 |
7 | 205253004325652 |
oct | 24646652330370 |
9 | 5054020580102 |
10 | 1431141200120 |
11 | 501a41996915 |
12 | 1b1446361048 |
13 | a4c575467c8 |
14 | 4d3a64396d2 |
15 | 2736205c115 |
hex | 14d36a9b0f8 |
1431141200120 has 64 divisors (see below), whose sum is σ = 3360296931840. Its totient is φ = 547530192000.
The previous prime is 1431141200101. The next prime is 1431141200131. The reversal of 1431141200120 is 210021411341.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1431141200092 and 1431141200101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16434695 + ... + 16521545.
It is an arithmetic number, because the mean of its divisors is an integer number (52504639560).
Almost surely, 21431141200120 is an apocalyptic number.
1431141200120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1431141200120 is an abundant number, since it is smaller than the sum of its proper divisors (1929155731720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1431141200120 is a wasteful number, since it uses less digits than its factorization.
1431141200120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104796 (or 104792 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1431141200120 its reverse (210021411341), we get a palindrome (1641162611461).
The spelling of 1431141200120 in words is "one trillion, four hundred thirty-one billion, one hundred forty-one million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •