Base | Representation |
---|---|
bin | 111101001111010… |
… | …110110001111000 |
3 | 2122121022010201212 |
4 | 331033112301320 |
5 | 4101010420030 |
6 | 245541302252 |
7 | 34314026120 |
oct | 7517266170 |
9 | 2577263655 |
10 | 1027435640 |
11 | 487a62670 |
12 | 248104988 |
13 | 134b24baa |
14 | 9a64dc80 |
15 | 60300595 |
hex | 3d3d6c78 |
1027435640 has 256 divisors, whose sum is σ = 3082060800. Its totient is φ = 298598400.
The previous prime is 1027435637. The next prime is 1027435657. The reversal of 1027435640 is 465347201.
It is a junction number, because it is equal to n+sod(n) for n = 1027435597 and 1027435606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5676350 + ... + 5676530.
It is an arithmetic number, because the mean of its divisors is an integer number (12039300).
Almost surely, 21027435640 is an apocalyptic number.
1027435640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1027435640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1541030400).
1027435640 is an abundant number, since it is smaller than the sum of its proper divisors (2054625160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1027435640 is a wasteful number, since it uses less digits than its factorization.
1027435640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326 (or 322 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 1027435640 is about 32053.6369231325. The cubic root of 1027435640 is about 1009.0628303151.
The spelling of 1027435640 in words is "one billion, twenty-seven million, four hundred thirty-five thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •