Base | Representation |
---|---|
bin | 111111101111011… |
… | …001000001110010 |
3 | 2202112020112101220 |
4 | 333233121001302 |
5 | 4142230403030 |
6 | 254040405510 |
7 | 35333434644 |
oct | 7757310162 |
9 | 2675215356 |
10 | 1069387890 |
11 | 4a9706a4a |
12 | 25a176896 |
13 | 1407231cc |
14 | a2050894 |
15 | 63d3aa10 |
hex | 3fbd9072 |
1069387890 has 64 divisors (see below), whose sum is σ = 2768846976. Its totient is φ = 263324672.
The previous prime is 1069387883. The next prime is 1069387927. The reversal of 1069387890 is 987839601.
It is a super-2 number, since 2×10693878902 = 2287180918557304200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7249 + ... + 46811.
It is an arithmetic number, because the mean of its divisors is an integer number (43263234).
Almost surely, 21069387890 is an apocalyptic number.
1069387890 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1069387890, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1384423488).
1069387890 is an abundant number, since it is smaller than the sum of its proper divisors (1699459086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1069387890 is a wasteful number, since it uses less digits than its factorization.
1069387890 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39643.
The product of its (nonzero) digits is 653184, while the sum is 51.
The square root of 1069387890 is about 32701.4967547359. The cubic root of 1069387890 is about 1022.6140466562.
The spelling of 1069387890 in words is "one billion, sixty-nine million, three hundred eighty-seven thousand, eight hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •