Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0100011110100000101 |
3 | 101111221221000202111010 |
4 | 1212131032203310011 |
5 | 3300301034201041 |
6 | 122312215232433 |
7 | 10643125521036 |
oct | 1463516436405 |
9 | 344857022433 |
10 | 110012022021 |
11 | 42723a11470 |
12 | 193a2978719 |
13 | a4b2b48c25 |
14 | 5478a32a8d |
15 | 2cdd1bea16 |
hex | 199d3a3d05 |
110012022021 has 32 divisors (see below), whose sum is σ = 170929761408. Its totient is φ = 62196592640.
The previous prime is 110012022007. The next prime is 110012022023. The reversal of 110012022021 is 120220210011.
It is a cyclic number.
It is not a de Polignac number, because 110012022021 - 25 = 110012021989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110012021988 and 110012022006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012022023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 804306 + ... + 931091.
It is an arithmetic number, because the mean of its divisors is an integer number (5341555044).
Almost surely, 2110012022021 is an apocalyptic number.
110012022021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110012022021 is a deficient number, since it is larger than the sum of its proper divisors (60917739387).
110012022021 is a wasteful number, since it uses less digits than its factorization.
110012022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1735541.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110012022021 its reverse (120220210011), we get a palindrome (230232232032).
The spelling of 110012022021 in words is "one hundred ten billion, twelve million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •