Base | Representation |
---|---|
bin | 1010000110000110110001… |
… | …0001111001000001110111 |
3 | 1110022011001221002220010122 |
4 | 2201201230101321001313 |
5 | 2423330311100402411 |
6 | 35335135234242155 |
7 | 2223643435200524 |
oct | 241415421710167 |
9 | 43264057086118 |
10 | 11100012122231 |
11 | 359a54151468a |
12 | 12b330b72635b |
13 | 62695a5b92c6 |
14 | 2a535a07014b |
15 | 143b0b9da9db |
hex | a186c479077 |
11100012122231 has 16 divisors (see below), whose sum is σ = 11767225155840. Its totient is φ = 10434386843520.
The previous prime is 11100012122207. The next prime is 11100012122317. The reversal of 11100012122231 is 13222121000111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11100012122231 - 26 = 11100012122167 is a prime.
It is a super-2 number, since 2×111000121222312 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100012122831) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227532800 + ... + 227581578.
It is an arithmetic number, because the mean of its divisors is an integer number (735451572240).
Almost surely, 211100012122231 is an apocalyptic number.
11100012122231 is a deficient number, since it is larger than the sum of its proper divisors (667213033609).
11100012122231 is a wasteful number, since it uses less digits than its factorization.
11100012122231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64774.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11100012122231 its reverse (13222121000111), we get a palindrome (24322133122342).
The spelling of 11100012122231 in words is "eleven trillion, one hundred billion, twelve million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •