Base | Representation |
---|---|
bin | 1010000011010001011000… |
… | …0001000100010011111010 |
3 | 1110010111101111201112121201 |
4 | 2200310112001010103322 |
5 | 2422031100434344122 |
6 | 35300523442124414 |
7 | 2220301006020451 |
oct | 240642601042372 |
9 | 43114344645551 |
10 | 11051320231162 |
11 | 35809251881a2 |
12 | 12a59a095070a |
13 | 62219a863443 |
14 | 2a2c5b371b98 |
15 | 14270bdd8a27 |
hex | a0d160444fa |
11051320231162 has 16 divisors (see below), whose sum is σ = 17220470145984. Its totient is φ = 5314959916000.
The previous prime is 11051320231073. The next prime is 11051320231177. The reversal of 11051320231162 is 26113202315011.
It is a super-2 number, since 2×110513202311622 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11051320231162.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 949094164 + ... + 949105807.
It is an arithmetic number, because the mean of its divisors is an integer number (1076279384124).
Almost surely, 211051320231162 is an apocalyptic number.
11051320231162 is a deficient number, since it is larger than the sum of its proper divisors (6169149914822).
11051320231162 is a wasteful number, since it uses less digits than its factorization.
11051320231162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1898200085.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 11051320231162 its reverse (26113202315011), we get a palindrome (37164522546173).
The spelling of 11051320231162 in words is "eleven trillion, fifty-one billion, three hundred twenty million, two hundred thirty-one thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •