Base | Representation |
---|---|
bin | 10010101011111110… |
… | …00100001001100110 |
3 | 221220011222022221000 |
4 | 21111333010021212 |
5 | 131021311430042 |
6 | 4335303534130 |
7 | 503421045444 |
oct | 112577041146 |
9 | 27804868830 |
10 | 10032530022 |
11 | 4289113329 |
12 | 1b3ba5a346 |
13 | c3b669bc8 |
14 | 6b25cdb94 |
15 | 3dab8674c |
hex | 255fc4266 |
10032530022 has 16 divisors (see below), whose sum is σ = 22294511280. Its totient is φ = 3344176656.
The previous prime is 10032530009. The next prime is 10032530033. The reversal of 10032530022 is 22003523001.
10032530022 is a `hidden beast` number, since 100 + 32 + 530 + 0 + 2 + 2 = 666.
10032530022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10032529977 and 10032530004.
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, 92893743 + ... + 92893850.
It is an arithmetic number, because the mean of its divisors is an integer number (1393406955).
Almost surely, 210032530022 is an apocalyptic number.
10032530022 is an abundant number, since it is smaller than the sum of its proper divisors (12261981258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10032530022 is a wasteful number, since it uses less digits than its factorization.
10032530022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185787604 (or 185787598 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The spelling of 10032530022 in words is "ten billion, thirty-two million, five hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •