Base | Representation |
---|---|
bin | 10011001100010101… |
… | …01110110111010110 |
3 | 222121002211122200100 |
4 | 21212022232313112 |
5 | 132100312232042 |
6 | 4422242554530 |
7 | 513225521235 |
oct | 114612566726 |
9 | 28532748610 |
10 | 10304024022 |
11 | 4408397836 |
12 | 1bb6968a46 |
13 | c82996a46 |
14 | 6da6a2b1c |
15 | 40491424c |
hex | 2662aedd6 |
10304024022 has 48 divisors (see below), whose sum is σ = 22647596400. Its totient is φ = 3385172736.
The previous prime is 10304024011. The next prime is 10304024023. The reversal of 10304024022 is 22042040301.
It is a super-2 number, since 2×103040240222 (a number of 21 digits) contains 22 as substring.
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 = 10304023986 and 10304024004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10304024023) 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 23 ways as a sum of consecutive naturals, for example, 3121729 + ... + 3125027.
It is an arithmetic number, because the mean of its divisors is an integer number (471824925).
Almost surely, 210304024022 is an apocalyptic number.
10304024022 is an abundant number, since it is smaller than the sum of its proper divisors (12343572378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10304024022 is a wasteful number, since it uses less digits than its factorization.
10304024022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5757 (or 5754 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 10304024022 its reverse (22042040301), we get a palindrome (32346064323).
The spelling of 10304024022 in words is "ten billion, three hundred four million, twenty-four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •