Base | Representation |
---|---|
bin | 10010101001011011… |
… | …01111000100100110 |
3 | 221211200212011101101 |
4 | 21110231233010212 |
5 | 131000332210042 |
6 | 4333222550314 |
7 | 503041611142 |
oct | 112455570446 |
9 | 27750764341 |
10 | 10011210022 |
11 | 42780812a0 |
12 | 1b3489839a |
13 | c37113a18 |
14 | 6ad840222 |
15 | 3d8d746b7 |
hex | 254b6f126 |
10011210022 has 16 divisors (see below), whose sum is σ = 16400606544. Its totient is φ = 4545376000.
The previous prime is 10011210007. The next prime is 10011210037. The reversal of 10011210022 is 22001211001.
10011210022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10011210007) and next prime (10011210037).
It is a super-3 number, since 3×100112100223 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10011209990 and 10011210008.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 238879 + ... + 277642.
It is an arithmetic number, because the mean of its divisors is an integer number (1025037909).
Almost surely, 210011210022 is an apocalyptic number.
10011210022 is a deficient number, since it is larger than the sum of its proper divisors (6389396522).
10011210022 is a wasteful number, since it uses less digits than its factorization.
10011210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517415.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10011210022 its reverse (22001211001), we get a palindrome (32012421023).
The spelling of 10011210022 in words is "ten billion, eleven million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •