Base | Representation |
---|---|
bin | 1110101001100100000000… |
… | …00011011110010111001101 |
3 | 11020001200000010211022120202 |
4 | 13110302000003132113031 |
5 | 13210300044144130240 |
6 | 152303031551023245 |
7 | 6533261640322466 |
oct | 724620003362715 |
9 | 136050003738522 |
10 | 32214403114445 |
11 | a2a0062804102 |
12 | 374344a50ab25 |
13 | 14c8a60c936c6 |
14 | 7d5284b69d6d |
15 | 3ace8593a315 |
hex | 1d4c800de5cd |
32214403114445 has 32 divisors (see below), whose sum is σ = 42354673653600. Its totient is φ = 23412509761536.
The previous prime is 32214403114391. The next prime is 32214403114469. The reversal of 32214403114445 is 54441130441223.
It can be written as a sum of positive squares in 16 ways, for example, as 1369119968836 + 30845283145609 = 1170094^2 + 5553853^2 .
It is a cyclic number.
It is not a de Polignac number, because 32214403114445 - 212 = 32214403110349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32214403114399 and 32214403114408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6847367 + ... + 10550603.
It is an arithmetic number, because the mean of its divisors is an integer number (1323583551675).
Almost surely, 232214403114445 is an apocalyptic number.
It is an amenable number.
32214403114445 is a deficient number, since it is larger than the sum of its proper divisors (10140270539155).
32214403114445 is a wasteful number, since it uses less digits than its factorization.
32214403114445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3706817.
The product of its (nonzero) digits is 184320, while the sum is 38.
Adding to 32214403114445 its reverse (54441130441223), we get a palindrome (86655533555668).
The spelling of 32214403114445 in words is "thirty-two trillion, two hundred fourteen billion, four hundred three million, one hundred fourteen thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •