Base | Representation |
---|---|
bin | 11101011011100000011… |
… | …01111100111000110110 |
3 | 10120200002021020101121102 |
4 | 32231300031330320312 |
5 | 113031414201120042 |
6 | 2052312221450102 |
7 | 133025323231433 |
oct | 16556015747066 |
9 | 3520067211542 |
10 | 1011200020022 |
11 | 35a93605a795 |
12 | 143b88a10932 |
13 | 7448178661a |
14 | 36d29b02b8a |
15 | 1b484b65b32 |
hex | eb7037ce36 |
1011200020022 has 4 divisors (see below), whose sum is σ = 1516800030036. Its totient is φ = 505600010010.
The previous prime is 1011200019979. The next prime is 1011200020081. The reversal of 1011200020022 is 2200200021101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×10112000200223 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011200019985 and 1011200020012.
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 as a sum of consecutive naturals, namely, 252800005004 + ... + 252800005007.
It is an arithmetic number, because the mean of its divisors is an integer number (379200007509).
Almost surely, 21011200020022 is an apocalyptic number.
1011200020022 is a deficient number, since it is larger than the sum of its proper divisors (505600010014).
1011200020022 is an equidigital number, since it uses as much as digits as its factorization.
1011200020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505600010013.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 1011200020022 its reverse (2200200021101), we get a palindrome (3211400041123).
The spelling of 1011200020022 in words is "one trillion, eleven billion, two hundred million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •