Base | Representation |
---|---|
bin | 10000010011000101110… |
… | …011011110000110000010 |
3 | 10222001221102121020010010 |
4 | 100103011303132012002 |
5 | 121322240041213442 |
6 | 2214305303245350 |
7 | 143626615531533 |
oct | 20230563360602 |
9 | 3861842536103 |
10 | 1120010101122 |
11 | 3a1aa255a150 |
12 | 161095149856 |
13 | 818025ab7b3 |
14 | 3c2ccc5c68a |
15 | 1e202564b9c |
hex | 104c5cde182 |
1120010101122 has 32 divisors (see below), whose sum is σ = 2467853054784. Its totient is φ = 336036632000.
The previous prime is 1120010101117. The next prime is 1120010101123. The reversal of 1120010101122 is 2211010100211.
It is a super-4 number, since 4×11200101011224 (a number of 49 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120010101098 and 1120010101107.
It is not an unprimeable number, because it can be changed into a prime (1120010101123) by changing a digit.
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, 84002493 + ... + 84015824.
It is an arithmetic number, because the mean of its divisors is an integer number (77120407962).
Almost surely, 21120010101122 is an apocalyptic number.
1120010101122 is an abundant number, since it is smaller than the sum of its proper divisors (1347842953662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120010101122 is a wasteful number, since it uses less digits than its factorization.
1120010101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168018434.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1120010101122 its reverse (2211010100211), we get a palindrome (3331020201333).
The spelling of 1120010101122 in words is "one trillion, one hundred twenty billion, ten million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •