Base | Representation |
---|---|
bin | 10100110110001101110… |
… | …111000100001100001001 |
3 | 12001221210122102022112012 |
4 | 110312031313010030021 |
5 | 141432433124211410 |
6 | 3014043530225305 |
7 | 205334160126536 |
oct | 24661567041411 |
9 | 5057718368465 |
10 | 1432604132105 |
11 | 502622759313 |
12 | 1b1794285235 |
13 | a512b65a933 |
14 | 4d4a484dd8d |
15 | 273ea6d3605 |
hex | 14d8ddc4309 |
1432604132105 has 4 divisors (see below), whose sum is σ = 1719124958532. Its totient is φ = 1146083305680.
The previous prime is 1432604132093. The next prime is 1432604132129. The reversal of 1432604132105 is 5012314062341.
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 402275599504 + 1030328532601 = 634252^2 + 1015051^2 .
It is not a de Polignac number, because 1432604132105 - 212 = 1432604128009 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 143260413206 + ... + 143260413215.
It is an arithmetic number, because the mean of its divisors is an integer number (429781239633).
Almost surely, 21432604132105 is an apocalyptic number.
It is an amenable number.
1432604132105 is a deficient number, since it is larger than the sum of its proper divisors (286520826427).
1432604132105 is an equidigital number, since it uses as much as digits as its factorization.
1432604132105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286520826426.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 1432604132105 its reverse (5012314062341), we get a palindrome (6444918194446).
The spelling of 1432604132105 in words is "one trillion, four hundred thirty-two billion, six hundred four million, one hundred thirty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •