Base | Representation |
---|---|
bin | 11101011011001010000… |
… | …01100011100001001000 |
3 | 10120122121011212012210002 |
4 | 32231211001203201020 |
5 | 113031023112033000 |
6 | 2052241432342132 |
7 | 133020553041425 |
oct | 16554501434110 |
9 | 3518534765702 |
10 | 1011012221000 |
11 | 35a84a050591 |
12 | 143b35b44948 |
13 | 744518b1942 |
14 | 36d0cbb8d4c |
15 | 1b47341b8d5 |
hex | eb65063848 |
1011012221000 has 64 divisors (see below), whose sum is σ = 2373232333680. Its totient is φ = 403129036800.
The previous prime is 1011012220997. The next prime is 1011012221041. The reversal of 1011012221000 is 1222101101.
It can be written as a sum of positive squares in 8 ways, for example, as 92086757764 + 918925463236 = 303458^2 + 958606^2 .
It is a super-2 number, since 2×10110122210002 (a number of 25 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1277657 + ... + 1911656.
Almost surely, 21011012221000 is an apocalyptic number.
1011012221000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011012221000 is an abundant number, since it is smaller than the sum of its proper divisors (1362220112680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011012221000 is a wasteful number, since it uses less digits than its factorization.
1011012221000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3189651 (or 3189637 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1011012221000 its reverse (1222101101), we get a palindrome (1012234322101).
The spelling of 1011012221000 in words is "one trillion, eleven billion, twelve million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •