Base | Representation |
---|---|
bin | 10100110101111011111… |
… | …010011001000011100001 |
3 | 12001221000122210221021222 |
4 | 110311323322121003201 |
5 | 141431324032422423 |
6 | 3013554012224425 |
7 | 205323542512526 |
oct | 24657372310341 |
9 | 5057018727258 |
10 | 1432303014113 |
11 | 502488790974 |
12 | 1b170b46b115 |
13 | a50b115acca |
14 | 4d47686914d |
15 | 273ce0533c8 |
hex | 14d7be990e1 |
1432303014113 has 4 divisors (see below), whose sum is σ = 1433021682948. Its totient is φ = 1431584345280.
The previous prime is 1432303014089. The next prime is 1432303014127. The reversal of 1432303014113 is 3114103032341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1160118559744 + 272184454369 = 1077088^2 + 521713^2 .
It is a cyclic number.
It is not a de Polignac number, because 1432303014113 - 28 = 1432303013857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1432303014713) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 359331428 + ... + 359335413.
It is an arithmetic number, because the mean of its divisors is an integer number (358255420737).
Almost surely, 21432303014113 is an apocalyptic number.
It is an amenable number.
1432303014113 is a deficient number, since it is larger than the sum of its proper divisors (718668835).
1432303014113 is an equidigital number, since it uses as much as digits as its factorization.
1432303014113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 718668834.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 1432303014113 its reverse (3114103032341), we get a palindrome (4546406046454).
The spelling of 1432303014113 in words is "one trillion, four hundred thirty-two billion, three hundred three million, fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •