Base | Representation |
---|---|
bin | 1001011001011011001101… |
… | …0010001011100010011001 |
3 | 1100120202202000102221111212 |
4 | 2112112303102023202121 |
5 | 2323241230441000033 |
6 | 33550350241232505 |
7 | 2114330415616343 |
oct | 226266322134231 |
9 | 40522660387455 |
10 | 10332404234393 |
11 | 3323a4790921a |
12 | 11aa5a5332735 |
13 | 59c45948b307 |
14 | 27a13bb1c293 |
15 | 12db8233b748 |
hex | 965b348b899 |
10332404234393 has 2 divisors, whose sum is σ = 10332404234394. Its totient is φ = 10332404234392.
The previous prime is 10332404234309. The next prime is 10332404234447. The reversal of 10332404234393 is 39343240423301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9061526796169 + 1270877438224 = 3010237^2 + 1127332^2 .
It is a cyclic number.
It is not a de Polignac number, because 10332404234393 - 222 = 10332400040089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10332404234393.
It is not a weakly prime, because it can be changed into another prime (10332404239393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5166202117196 + 5166202117197.
It is an arithmetic number, because the mean of its divisors is an integer number (5166202117197).
Almost surely, 210332404234393 is an apocalyptic number.
It is an amenable number.
10332404234393 is a deficient number, since it is larger than the sum of its proper divisors (1).
10332404234393 is an equidigital number, since it uses as much as digits as its factorization.
10332404234393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 559872, while the sum is 41.
Adding to 10332404234393 its reverse (39343240423301), we get a palindrome (49675644657694).
The spelling of 10332404234393 in words is "ten trillion, three hundred thirty-two billion, four hundred four million, two hundred thirty-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •