Base | Representation |
---|---|
bin | 10100110100101111011… |
… | …101000011110010110000 |
3 | 12001210201021002002120020 |
4 | 110310233131003302300 |
5 | 141421212141201212 |
6 | 3013222430243440 |
7 | 205250005324314 |
oct | 24645735036260 |
9 | 5053637062506 |
10 | 1431020256432 |
11 | 50198a6a0058 |
12 | 1b1411956580 |
13 | a4c3847c1b0 |
14 | 4d394355b44 |
15 | 2735661bd8c |
hex | 14d2f743cb0 |
1431020256432 has 80 divisors (see below), whose sum is σ = 3992261978880. Its totient is φ = 439087355136.
The previous prime is 1431020256319. The next prime is 1431020256433. The reversal of 1431020256432 is 2346520201341.
It is a junction number, because it is equal to n+sod(n) for n = 1431020256393 and 1431020256402.
It is not an unprimeable number, because it can be changed into a prime (1431020256433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2969998 + ... + 3418029.
It is an arithmetic number, because the mean of its divisors is an integer number (49903274736).
Almost surely, 21431020256432 is an apocalyptic number.
1431020256432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1431020256432 is an abundant number, since it is smaller than the sum of its proper divisors (2561241722448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1431020256432 is a wasteful number, since it uses less digits than its factorization.
1431020256432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6388410 (or 6388404 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 1431020256432 its reverse (2346520201341), we get a palindrome (3777540457773).
The spelling of 1431020256432 in words is "one trillion, four hundred thirty-one billion, twenty million, two hundred fifty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •