Base | Representation |
---|---|
bin | 11110000011000010010… |
… | …01111010100111001001 |
3 | 10122200212021101210210102 |
4 | 33001201021322213021 |
5 | 113403400031442421 |
6 | 2110142125255145 |
7 | 134406245253413 |
oct | 17014111724711 |
9 | 3580767353712 |
10 | 1032422140361 |
11 | 368936423917 |
12 | 1481101044b5 |
13 | 764843cbc91 |
14 | 37d804359b3 |
15 | 1bcc7d3b60b |
hex | f06127a9c9 |
1032422140361 has 2 divisors, whose sum is σ = 1032422140362. Its totient is φ = 1032422140360.
The previous prime is 1032422140291. The next prime is 1032422140483. The reversal of 1032422140361 is 1630412242301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1032369795136 + 52345225 = 1016056^2 + 7235^2 .
It is an emirp because it is prime and its reverse (1630412242301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1032422140361 - 218 = 1032421878217 is a prime.
It is not a weakly prime, because it can be changed into another prime (1032422160361) by changing a digit.
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 as a sum of consecutive naturals, namely, 516211070180 + 516211070181.
It is an arithmetic number, because the mean of its divisors is an integer number (516211070181).
Almost surely, 21032422140361 is an apocalyptic number.
It is an amenable number.
1032422140361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032422140361 is an equidigital number, since it uses as much as digits as its factorization.
1032422140361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1032422140361 its reverse (1630412242301), we get a palindrome (2662834382662).
The spelling of 1032422140361 in words is "one trillion, thirty-two billion, four hundred twenty-two million, one hundred forty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •