Base | Representation |
---|---|
bin | 111100010101110… |
… | …010111001001000 |
3 | 2121112220112020121 |
4 | 330111302321020 |
5 | 4033130041230 |
6 | 244242033024 |
7 | 34041542230 |
oct | 7425627110 |
9 | 2545815217 |
10 | 1012346440 |
11 | 47a496956 |
12 | 243048774 |
13 | 131970a81 |
14 | 98642cc0 |
15 | 5dd1e77a |
hex | 3c572e48 |
1012346440 has 32 divisors (see below), whose sum is σ = 2603177280. Its totient is φ = 347090112.
The previous prime is 1012346399. The next prime is 1012346443. The reversal of 1012346440 is 446432101.
1012346440 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (1012346443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1807482 + ... + 1808041.
It is an arithmetic number, because the mean of its divisors is an integer number (81349290).
Almost surely, 21012346440 is an apocalyptic number.
1012346440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012346440 is an abundant number, since it is smaller than the sum of its proper divisors (1590830840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012346440 is a wasteful number, since it uses less digits than its factorization.
1012346440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3615541 (or 3615537 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
The square root of 1012346440 is about 31817.3920992906. The cubic root of 1012346440 is about 1004.0986580511.
Adding to 1012346440 its reverse (446432101), we get a palindrome (1458778541).
The spelling of 1012346440 in words is "one billion, twelve million, three hundred forty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •