Base | Representation |
---|---|
bin | 10100111010101111… |
… | …11000111011110110 |
3 | 1001222122122021201220 |
4 | 22131113320323312 |
5 | 140444414020042 |
6 | 5054210331210 |
7 | 545203203150 |
oct | 123527707366 |
9 | 31878567656 |
10 | 11230220022 |
11 | 484319157a |
12 | 2214b89b06 |
13 | 109c832b08 |
14 | 7876bbad0 |
15 | 45adb78ec |
hex | 29d5f8ef6 |
11230220022 has 64 divisors (see below), whose sum is σ = 26516865024. Its totient is φ = 3102815520.
The previous prime is 11230220017. The next prime is 11230220039. The reversal of 11230220022 is 22002203211.
It is a happy number.
It is a super-3 number, since 3×112302200223 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11230219983 and 11230220010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2480653 + ... + 2485175.
It is an arithmetic number, because the mean of its divisors is an integer number (414326016).
Almost surely, 211230220022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11230220022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13258432512).
11230220022 is an abundant number, since it is smaller than the sum of its proper divisors (15286645002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11230220022 is a wasteful number, since it uses less digits than its factorization.
11230220022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6473.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 11230220022 its reverse (22002203211), we get a palindrome (33232423233).
The spelling of 11230220022 in words is "eleven billion, two hundred thirty million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •