Base | Representation |
---|---|
bin | 101010011000111… |
… | …0000011011100000 |
3 | 10200010100211100220 |
4 | 1110301300123200 |
5 | 10403104021233 |
6 | 353045243040 |
7 | 50150413302 |
oct | 12461603340 |
9 | 3603324326 |
10 | 1422329568 |
11 | 66a960290 |
12 | 338403480 |
13 | 19889933a |
14 | d6c85972 |
15 | 84d05eb3 |
hex | 54c706e0 |
1422329568 has 192 divisors, whose sum is σ = 4288660992. Its totient is φ = 408545280.
The previous prime is 1422329567. The next prime is 1422329603. The reversal of 1422329568 is 8659232241.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1422329561) 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 31 ways as a sum of consecutive naturals, for example, 3813030 + ... + 3813402.
It is an arithmetic number, because the mean of its divisors is an integer number (22336776).
Almost surely, 21422329568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1422329568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2144330496).
1422329568 is an abundant number, since it is smaller than the sum of its proper divisors (2866331424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1422329568 is a wasteful number, since it uses less digits than its factorization.
1422329568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577 (or 569 counting only the distinct ones).
The product of its digits is 207360, while the sum is 42.
The square root of 1422329568 is about 37713.7848538170. The cubic root of 1422329568 is about 1124.6051797745.
The spelling of 1422329568 in words is "one billion, four hundred twenty-two million, three hundred twenty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •