Base | Representation |
---|---|
bin | 1010000000010010001110… |
… | …0001011111011010010111 |
3 | 1102221120221102020211221020 |
4 | 2200010203201133122113 |
5 | 2420211003322231111 |
6 | 35221200014252223 |
7 | 2213503301463354 |
oct | 240044341373227 |
9 | 42846842224836 |
10 | 11000007227031 |
11 | 3561093345769 |
12 | 1297a601b7073 |
13 | 61a3b0a846c4 |
14 | 2a05904d762b |
15 | 141207135906 |
hex | a012385f697 |
11000007227031 has 8 divisors (see below), whose sum is σ = 14666839494000. Its totient is φ = 7333256555712.
The previous prime is 11000007227021. The next prime is 11000007227047. The reversal of 11000007227031 is 13072270000011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11000007227031 - 215 = 11000007194263 is a prime.
It is a super-2 number, since 2×110000072270312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11000007226992 and 11000007227010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000007227021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20083656 + ... + 20624093.
It is an arithmetic number, because the mean of its divisors is an integer number (1833354936750).
Almost surely, 211000007227031 is an apocalyptic number.
11000007227031 is a deficient number, since it is larger than the sum of its proper divisors (3666832266969).
11000007227031 is an equidigital number, since it uses as much as digits as its factorization.
11000007227031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40797825.
The product of its (nonzero) digits is 588, while the sum is 24.
Adding to 11000007227031 its reverse (13072270000011), we get a palindrome (24072277227042).
The spelling of 11000007227031 in words is "eleven trillion, seven million, two hundred twenty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •