Base | Representation |
---|---|
bin | 11110000010010000001… |
… | …11010010101011111001 |
3 | 10122122202222212120221012 |
4 | 33001020013102223321 |
5 | 113402020004202022 |
6 | 2110032320523305 |
7 | 134362654311062 |
oct | 17011007225371 |
9 | 3578688776835 |
10 | 1032002022137 |
11 | 368740267879 |
12 | 148013480535 |
13 | 76418365508 |
14 | 37d40715569 |
15 | 1bca1001de2 |
hex | f0481d2af9 |
1032002022137 has 2 divisors, whose sum is σ = 1032002022138. Its totient is φ = 1032002022136.
The previous prime is 1032002022101. The next prime is 1032002022199. The reversal of 1032002022137 is 7312202002301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 626909234176 + 405092787961 = 791776^2 + 636469^2 .
It is a cyclic number.
It is not a de Polignac number, because 1032002022137 - 212 = 1032002018041 is a prime.
It is a super-3 number, since 3×10320020221373 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1032002022437) 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, 516001011068 + 516001011069.
It is an arithmetic number, because the mean of its divisors is an integer number (516001011069).
Almost surely, 21032002022137 is an apocalyptic number.
It is an amenable number.
1032002022137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032002022137 is an equidigital number, since it uses as much as digits as its factorization.
1032002022137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 23.
Adding to 1032002022137 its reverse (7312202002301), we get a palindrome (8344204024438).
The spelling of 1032002022137 in words is "one trillion, thirty-two billion, two million, twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •