Base | Representation |
---|---|
bin | 1110101111100011101111… |
… | …10011110011111100101001 |
3 | 11020210100210001000002210211 |
4 | 13113301313303303330221 |
5 | 13222134011321033113 |
6 | 152541423052541121 |
7 | 6554204211326611 |
oct | 727616763637451 |
9 | 136710701002724 |
10 | 32420423221033 |
11 | a36a473789501 |
12 | 37773661817a1 |
13 | 151230459b413 |
14 | 80122a5b1a41 |
15 | 3b34e2669b3d |
hex | 1d7c77cf3f29 |
32420423221033 has 2 divisors, whose sum is σ = 32420423221034. Its totient is φ = 32420423221032.
The previous prime is 32420423221009. The next prime is 32420423221037. The reversal of 32420423221033 is 33012232402423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27714612794089 + 4705810426944 = 5264467^2 + 2169288^2 .
It is a cyclic number.
It is not a de Polignac number, because 32420423221033 - 225 = 32420389666601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32420423220986 and 32420423221004.
It is not a weakly prime, because it can be changed into another prime (32420423221037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16210211610516 + 16210211610517.
It is an arithmetic number, because the mean of its divisors is an integer number (16210211610517).
Almost surely, 232420423221033 is an apocalyptic number.
It is an amenable number.
32420423221033 is a deficient number, since it is larger than the sum of its proper divisors (1).
32420423221033 is an equidigital number, since it uses as much as digits as its factorization.
32420423221033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 32420423221033 its reverse (33012232402423), we get a palindrome (65432655623456).
The spelling of 32420423221033 in words is "thirty-two trillion, four hundred twenty billion, four hundred twenty-three million, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •