Base | Representation |
---|---|
bin | 100111101000110… |
… | …0110000100000110 |
3 | 10102200122122001100 |
4 | 1033101212010012 |
5 | 10210440344142 |
6 | 335550440530 |
7 | 44646630144 |
oct | 11721460406 |
9 | 3380578040 |
10 | 1330012422 |
11 | 622837022 |
12 | 311503146 |
13 | 1827157cb |
14 | c88d4594 |
15 | 7bb6cb4c |
hex | 4f466106 |
1330012422 has 48 divisors (see below), whose sum is σ = 2942267328. Its totient is φ = 434054400.
The previous prime is 1330012381. The next prime is 1330012429. The reversal of 1330012422 is 2242100331.
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 = 1330012395 and 1330012404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330012429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 564547 + ... + 566897.
It is an arithmetic number, because the mean of its divisors is an integer number (61297236).
Almost surely, 21330012422 is an apocalyptic number.
1330012422 is an abundant number, since it is smaller than the sum of its proper divisors (1612254906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330012422 is a wasteful number, since it uses less digits than its factorization.
1330012422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3005 (or 3002 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1330012422 is about 36469.3353654821. The cubic root of 1330012422 is about 1099.7278726293.
Adding to 1330012422 its reverse (2242100331), we get a palindrome (3572112753).
The spelling of 1330012422 in words is "one billion, three hundred thirty million, twelve thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •