Base | Representation |
---|---|
bin | 11101101010000010100101… |
… | …010110111111011001110001 |
3 | 122002211012200010002101122122 |
4 | 131222002211112333121301 |
5 | 114044000413311044213 |
6 | 1141223442412244025 |
7 | 36321266001423143 |
oct | 3552024526773161 |
9 | 562735603071578 |
10 | 130432341112433 |
11 | 38618055215018 |
12 | 127667b3170615 |
13 | 57a19422c6739 |
14 | 242cd5d69ac93 |
15 | 1012ca03add08 |
hex | 76a0a55bf671 |
130432341112433 has 16 divisors (see below), whose sum is σ = 130658676220800. Its totient is φ = 130206241818240.
The previous prime is 130432341112421. The next prime is 130432341112453. The reversal of 130432341112433 is 334211143234031.
It is a cyclic number.
It is not a de Polignac number, because 130432341112433 - 26 = 130432341112369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130432341112393 and 130432341112402.
It is not an unprimeable number, because it can be changed into a prime (130432341112453) 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, 9002155853 + ... + 9002170341.
It is an arithmetic number, because the mean of its divisors is an integer number (8166167263800).
Almost surely, 2130432341112433 is an apocalyptic number.
It is an amenable number.
130432341112433 is a deficient number, since it is larger than the sum of its proper divisors (226335108367).
130432341112433 is a wasteful number, since it uses less digits than its factorization.
130432341112433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21592.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 130432341112433 its reverse (334211143234031), we get a palindrome (464643484346464).
The spelling of 130432341112433 in words is "one hundred thirty trillion, four hundred thirty-two billion, three hundred forty-one million, one hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •