Base | Representation |
---|---|
bin | 1010001000000001101010… |
… | …1000010101000110010111 |
3 | 1110102022020001101212212222 |
4 | 2202000122220111012113 |
5 | 2424400342003323111 |
6 | 35402232554132555 |
7 | 2226222111500405 |
oct | 242003250250627 |
9 | 43368201355788 |
10 | 11133002011031 |
11 | 360253044239a |
12 | 12b9797a2115b |
13 | 629ab7235574 |
14 | 2a6ba960c475 |
15 | 1448dcd5c7db |
hex | a201aa15197 |
11133002011031 has 16 divisors (see below), whose sum is σ = 11770063119360. Its totient is φ = 10508829096480.
The previous prime is 11133002010979. The next prime is 11133002011051. The reversal of 11133002011031 is 13011020033111.
It is a de Polignac number, because none of the positive numbers 2k-11133002011031 is a prime.
It is a super-2 number, since 2×111330020110312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133002011051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2032196 + ... + 5137686.
It is an arithmetic number, because the mean of its divisors is an integer number (735628944960).
Almost surely, 211133002011031 is an apocalyptic number.
11133002011031 is a deficient number, since it is larger than the sum of its proper divisors (637061108329).
11133002011031 is a wasteful number, since it uses less digits than its factorization.
11133002011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3107566.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11133002011031 its reverse (13011020033111), we get a palindrome (24144022044142).
The spelling of 11133002011031 in words is "eleven trillion, one hundred thirty-three billion, two million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •