Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0000111011111101000110 |
3 | 1022110001110011220001200021 |
4 | 2101223211100323331012 |
5 | 2303010233234101042 |
6 | 33143013430005354 |
7 | 2052164614564543 |
oct | 221534520737506 |
9 | 38401404801607 |
10 | 10011120222022 |
11 | 320a768415457 |
12 | 115827baa685a |
13 | 578076c56b5a |
14 | 26877dd75bca |
15 | 12562b32d867 |
hex | 91ae543bf46 |
10011120222022 has 8 divisors (see below), whose sum is σ = 15016740508872. Its totient is φ = 5005540052400.
The previous prime is 10011120221981. The next prime is 10011120222043. The reversal of 10011120222022 is 22022202111001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×100111202220223 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10011120221987 and 10011120222005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9397479 + ... + 10408402.
It is an arithmetic number, because the mean of its divisors is an integer number (1877092563609).
Almost surely, 210011120222022 is an apocalyptic number.
10011120222022 is a deficient number, since it is larger than the sum of its proper divisors (5005620286850).
10011120222022 is a wasteful number, since it uses less digits than its factorization.
10011120222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20058614.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10011120222022 its reverse (22022202111001), we get a palindrome (32033322333023).
The spelling of 10011120222022 in words is "ten trillion, eleven billion, one hundred twenty million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •