Base | Representation |
---|---|
bin | 10000011101100110101… |
… | …111110111110000001011 |
3 | 11000011002020221220010201 |
4 | 100131212233313300023 |
5 | 122013400324132021 |
6 | 2223413453553031 |
7 | 144506450145646 |
oct | 20354657676013 |
9 | 4004066856121 |
10 | 1131300224011 |
11 | 3a6866535621 |
12 | 1633061a5777 |
13 | 828b1656299 |
14 | 3ca80490a5d |
15 | 1e663811591 |
hex | 10766bf7c0b |
1131300224011 has 4 divisors (see below), whose sum is σ = 1131338567632. Its totient is φ = 1131261880392.
The previous prime is 1131300224009. The next prime is 1131300224069. The reversal of 1131300224011 is 1104220031311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1131300224011 - 21 = 1131300224009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1131300224011.
It is not an unprimeable number, because it can be changed into a prime (1131300224081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19127520 + ... + 19186573.
It is an arithmetic number, because the mean of its divisors is an integer number (282834641908).
Almost surely, 21131300224011 is an apocalyptic number.
1131300224011 is a deficient number, since it is larger than the sum of its proper divisors (38343621).
1131300224011 is an equidigital number, since it uses as much as digits as its factorization.
1131300224011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38343620.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1131300224011 its reverse (1104220031311), we get a palindrome (2235520255322).
The spelling of 1131300224011 in words is "one trillion, one hundred thirty-one billion, three hundred million, two hundred twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •