Base | Representation |
---|---|
bin | 10000000001011010000… |
… | …011100100011111101011 |
3 | 10220020221011002211001110 |
4 | 100001122003210133223 |
5 | 121014343230410011 |
6 | 2201445221321403 |
7 | 142355235642252 |
oct | 20013203443753 |
9 | 3806834084043 |
10 | 1101022513131 |
11 | 394a39561272 |
12 | 159476266263 |
13 | 7ca97898728 |
14 | 3b40b1d5799 |
15 | 1d99062cba6 |
hex | 1005a0e47eb |
1101022513131 has 4 divisors (see below), whose sum is σ = 1468030017512. Its totient is φ = 734015008752.
The previous prime is 1101022513121. The next prime is 1101022513169. The reversal of 1101022513131 is 1313152201011.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1101022513131 - 218 = 1101022250987 is a prime.
It is a super-2 number, since 2×11010225131312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101022513098 and 1101022513107.
It is not an unprimeable number, because it can be changed into a prime (1101022513121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 183503752186 + ... + 183503752191.
It is an arithmetic number, because the mean of its divisors is an integer number (367007504378).
Almost surely, 21101022513131 is an apocalyptic number.
1101022513131 is a deficient number, since it is larger than the sum of its proper divisors (367007504381).
1101022513131 is an equidigital number, since it uses as much as digits as its factorization.
1101022513131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367007504380.
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 1101022513131 its reverse (1313152201011), we get a palindrome (2414174714142).
The spelling of 1101022513131 in words is "one trillion, one hundred one billion, twenty-two million, five hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •