Base | Representation |
---|---|
bin | 110001000111010011101110… |
… | …1101001000111011001110000 |
3 | 2002122122001002001010221021111 |
4 | 1202032213131221013121300 |
5 | 423111100113011323440 |
6 | 4130452011220203104 |
7 | 156665623654161520 |
oct | 14216473551073160 |
9 | 2078561061127244 |
10 | 432013004011120 |
11 | 11571a760232564 |
12 | 40553020b39494 |
13 | 157098613989ac |
14 | 7897780575680 |
15 | 34e29b287a4ea |
hex | 188e9dda47670 |
432013004011120 has 160 divisors (see below), whose sum is σ = 1202384340191232. Its totient is φ = 141140095067136.
The previous prime is 432013004011109. The next prime is 432013004011123. The reversal of 432013004011120 is 21110400310234.
It is a junction number, because it is equal to n+sod(n) for n = 432013004011091 and 432013004011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (432013004011123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60379447 + ... + 67154326.
Almost surely, 2432013004011120 is an apocalyptic number.
432013004011120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
432013004011120 is an abundant number, since it is smaller than the sum of its proper divisors (770371336180112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
432013004011120 is a wasteful number, since it uses less digits than its factorization.
432013004011120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127534079 (or 127534073 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 432013004011120 its reverse (21110400310234), we get a palindrome (453123404321354).
The spelling of 432013004011120 in words is "four hundred thirty-two trillion, thirteen billion, four million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •