Base | Representation |
---|---|
bin | 111110000000111… |
… | …000110111100010 |
3 | 2200111201211101000 |
4 | 332000320313202 |
5 | 4112321422242 |
6 | 251123452430 |
7 | 34532266254 |
oct | 7600706742 |
9 | 2614654330 |
10 | 1040420322 |
11 | 494321207 |
12 | 250527116 |
13 | 137720136 |
14 | 9c26dcd4 |
15 | 61517a4c |
hex | 3e038de2 |
1040420322 has 64 divisors (see below), whose sum is σ = 2344550400. Its totient is φ = 341969040.
The previous prime is 1040420299. The next prime is 1040420323. The reversal of 1040420322 is 2230240401.
1040420322 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 = 1040420295 and 1040420304.
It is not an unprimeable number, because it can be changed into a prime (1040420323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1446679 + ... + 1447397.
It is an arithmetic number, because the mean of its divisors is an integer number (36633600).
Almost surely, 21040420322 is an apocalyptic number.
1040420322 is an abundant number, since it is smaller than the sum of its proper divisors (1304130078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040420322 is a wasteful number, since it uses less digits than its factorization.
1040420322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1068 (or 1062 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 1040420322 is about 32255.5471508390. The cubic root of 1040420322 is about 1013.2958768424.
Adding to 1040420322 its reverse (2230240401), we get a palindrome (3270660723).
The spelling of 1040420322 in words is "one billion, forty million, four hundred twenty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •