Base | Representation |
---|---|
bin | 10000011100100001000… |
… | …000001111101000011001 |
3 | 11000001001201011222211211 |
4 | 100130201000033220121 |
5 | 122004001302023001 |
6 | 2223101414223121 |
7 | 144435451305523 |
oct | 20344100175031 |
9 | 4001051158754 |
10 | 1130130111001 |
11 | 3a6315a92381 |
12 | 16303a354aa1 |
13 | 827560c7518 |
14 | 3c9acd00a13 |
15 | 1e5e5c2b351 |
hex | 1072100fa19 |
1130130111001 has 2 divisors, whose sum is σ = 1130130111002. Its totient is φ = 1130130111000.
The previous prime is 1130130110959. The next prime is 1130130111013. The reversal of 1130130111001 is 1001110310311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1022729712601 + 107400398400 = 1011301^2 + 327720^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130130111001 - 27 = 1130130110873 is a prime.
It is a super-2 number, since 2×11301301110012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1130131111001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565065055500 + 565065055501.
It is an arithmetic number, because the mean of its divisors is an integer number (565065055501).
Almost surely, 21130130111001 is an apocalyptic number.
It is an amenable number.
1130130111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130130111001 is an equidigital number, since it uses as much as digits as its factorization.
1130130111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 1130130111001 its reverse (1001110310311), we get a palindrome (2131240421312).
The spelling of 1130130111001 in words is "one trillion, one hundred thirty billion, one hundred thirty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •