Base | Representation |
---|---|
bin | 10011000011101010… |
… | …11001010110100110 |
3 | 222102001001000021200 |
4 | 21201311121112212 |
5 | 131423204301042 |
6 | 4411124423330 |
7 | 511353542115 |
oct | 114165312646 |
9 | 28361030250 |
10 | 10231322022 |
11 | 4380350739 |
12 | 1b96547b46 |
13 | c708c03cc |
14 | 6d0b79c7c |
15 | 3ed352c4c |
hex | 261d595a6 |
10231322022 has 24 divisors (see below), whose sum is σ = 22233657576. Its totient is φ = 3400318656.
The previous prime is 10231322009. The next prime is 10231322039. The reversal of 10231322022 is 22022313201.
10231322022 is digitally balanced in base 2 and base 5, because in such bases 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 = 10231321986 and 10231322004.
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 11 ways as a sum of consecutive naturals, for example, 837268 + ... + 849399.
It is an arithmetic number, because the mean of its divisors is an integer number (926402399).
Almost surely, 210231322022 is an apocalyptic number.
10231322022 is an abundant number, since it is smaller than the sum of its proper divisors (12002335554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10231322022 is a wasteful number, since it uses less digits than its factorization.
10231322022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1687012 (or 1687009 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 10231322022 its reverse (22022313201), we get a palindrome (32253635223).
The spelling of 10231322022 in words is "ten billion, two hundred thirty-one million, three hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •