Base | Representation |
---|---|
bin | 10000011110011101001… |
… | …011000110010000100101 |
3 | 11000020102220010112102101 |
4 | 100132131023012100211 |
5 | 122022233103042411 |
6 | 2224044233012101 |
7 | 144541205344255 |
oct | 20363513062045 |
9 | 4006386115371 |
10 | 1132213330981 |
11 | 3a71949aa387 |
12 | 16351bb54031 |
13 | 829c888b775 |
14 | 3cb2985d965 |
15 | 1e6b8a7b8c1 |
hex | 1079d2c6425 |
1132213330981 has 2 divisors, whose sum is σ = 1132213330982. Its totient is φ = 1132213330980.
The previous prime is 1132213330973. The next prime is 1132213331129. The reversal of 1132213330981 is 1890333122311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 977658202756 + 154555128225 = 988766^2 + 393135^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132213330981 - 23 = 1132213330973 is a prime.
It is a super-2 number, since 2×11322133309812 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1132213330981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132213330901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566106665490 + 566106665491.
It is an arithmetic number, because the mean of its divisors is an integer number (566106665491).
Almost surely, 21132213330981 is an apocalyptic number.
It is an amenable number.
1132213330981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132213330981 is an equidigital number, since it uses as much as digits as its factorization.
1132213330981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 37.
The spelling of 1132213330981 in words is "one trillion, one hundred thirty-two billion, two hundred thirteen million, three hundred thirty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •