Base | Representation |
---|---|
bin | 11101001010110010100… |
… | …01011110000000111101 |
3 | 10112210220210101211011211 |
4 | 32211121101132000331 |
5 | 112410024113202311 |
6 | 2044225454444421 |
7 | 132260034026062 |
oct | 16453121360075 |
9 | 3483823354154 |
10 | 1002225131581 |
11 | 35704aa60213 |
12 | 1422a3203711 |
13 | 7368128924b |
14 | 36717b86c69 |
15 | 1b10bc99821 |
hex | e95945e03d |
1002225131581 has 2 divisors, whose sum is σ = 1002225131582. Its totient is φ = 1002225131580.
The previous prime is 1002225131521. The next prime is 1002225131587. The reversal of 1002225131581 is 1851315222001.
It is a happy number.
1002225131581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 705952844100 + 296272287481 = 840210^2 + 544309^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002225131581 - 211 = 1002225129533 is a prime.
It is a super-2 number, since 2×10022251315812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1002225131587) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501112565790 + 501112565791.
It is an arithmetic number, because the mean of its divisors is an integer number (501112565791).
Almost surely, 21002225131581 is an apocalyptic number.
It is an amenable number.
1002225131581 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002225131581 is an equidigital number, since it uses as much as digits as its factorization.
1002225131581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4800, while the sum is 31.
The spelling of 1002225131581 in words is "one trillion, two billion, two hundred twenty-five million, one hundred thirty-one thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •