Base | Representation |
---|---|
bin | 10100110100111010111… |
… | …001000000100001011000 |
3 | 12001211012122010101222001 |
4 | 110310322321000201120 |
5 | 141422110301214230 |
6 | 3013253443010344 |
7 | 205254525254506 |
oct | 24647271004130 |
9 | 5054178111861 |
10 | 1431212132440 |
11 | 501a78a34372 |
12 | 1b14660699b4 |
13 | a4c691507ac |
14 | 4d3b1a21676 |
15 | 273683be0ca |
hex | 14d3ae40858 |
1431212132440 has 32 divisors (see below), whose sum is σ = 3295116308880. Its totient is φ = 559171251072.
The previous prime is 1431212132423. The next prime is 1431212132477. The reversal of 1431212132440 is 442312121341.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1431212132399 and 1431212132408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 416048319 + ... + 416051758.
Almost surely, 21431212132440 is an apocalyptic number.
1431212132440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1431212132440 is an abundant number, since it is smaller than the sum of its proper divisors (1863904176440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1431212132440 is a wasteful number, since it uses less digits than its factorization.
1431212132440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832100131 (or 832100127 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1431212132440 its reverse (442312121341), we get a palindrome (1873524253781).
The spelling of 1431212132440 in words is "one trillion, four hundred thirty-one billion, two hundred twelve million, one hundred thirty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •