Base | Representation |
---|---|
bin | 1110101101010000101000… |
… | …10010110011111010101001 |
3 | 11020111210220212001212110112 |
4 | 13112220110102303322221 |
5 | 13214340234204330231 |
6 | 152441242050424105 |
7 | 6545410065003305 |
oct | 726502422637251 |
9 | 136453825055415 |
10 | 32341444214441 |
11 | a339a2513492a |
12 | 3763ba4292035 |
13 | 1507a28b4411b |
14 | 7db49728ad05 |
15 | 3b141db2792b |
hex | 1d6a144b3ea9 |
32341444214441 has 2 divisors, whose sum is σ = 32341444214442. Its totient is φ = 32341444214440.
The previous prime is 32341444214389. The next prime is 32341444214479. The reversal of 32341444214441 is 14441244414323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23551405174441 + 8790039040000 = 4852979^2 + 2964800^2 .
It is a cyclic number.
It is not a de Polignac number, because 32341444214441 - 214 = 32341444198057 is a prime.
It is not a weakly prime, because it can be changed into another prime (32341444214141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16170722107220 + 16170722107221.
It is an arithmetic number, because the mean of its divisors is an integer number (16170722107221).
Almost surely, 232341444214441 is an apocalyptic number.
It is an amenable number.
32341444214441 is a deficient number, since it is larger than the sum of its proper divisors (1).
32341444214441 is an equidigital number, since it uses as much as digits as its factorization.
32341444214441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 589824, while the sum is 41.
Adding to 32341444214441 its reverse (14441244414323), we get a palindrome (46782688628764).
The spelling of 32341444214441 in words is "thirty-two trillion, three hundred forty-one billion, four hundred forty-four million, two hundred fourteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •