Base | Representation |
---|---|
bin | 10000011110001011000… |
… | …011011101110101000001 |
3 | 11000012122201010012211222 |
4 | 100132023003131311001 |
5 | 122021122242343411 |
6 | 2223554133244425 |
7 | 144530524434503 |
oct | 20361303356501 |
9 | 4005581105758 |
10 | 1131909340481 |
11 | 3a704934a867 |
12 | 163456193715 |
13 | 8297a8c452a |
14 | 3cadb32bd73 |
15 | 1e69c0304db |
hex | 1078b0ddd41 |
1131909340481 has 2 divisors, whose sum is σ = 1131909340482. Its totient is φ = 1131909340480.
The previous prime is 1131909340423. The next prime is 1131909340553. The reversal of 1131909340481 is 1840439091311.
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., 1057522232881 + 74387107600 = 1028359^2 + 272740^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1131909340481 is a prime.
It is a super-2 number, since 2×11319093404812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1131909348481) 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, 565954670240 + 565954670241.
It is an arithmetic number, because the mean of its divisors is an integer number (565954670241).
Almost surely, 21131909340481 is an apocalyptic number.
It is an amenable number.
1131909340481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131909340481 is an equidigital number, since it uses as much as digits as its factorization.
1131909340481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 44.
The spelling of 1131909340481 in words is "one trillion, one hundred thirty-one billion, nine hundred nine million, three hundred forty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •