Base | Representation |
---|---|
bin | 111111011011101… |
… | …011001000000000 |
3 | 2202011111221012120 |
4 | 333123223020000 |
5 | 4134420003021 |
6 | 253333524240 |
7 | 35241466461 |
oct | 7733531000 |
9 | 2664457176 |
10 | 1064219136 |
11 | 4a67a6652 |
12 | 2584a3680 |
13 | 13c633686 |
14 | a14a6d68 |
15 | 636692c6 |
hex | 3f6eb200 |
1064219136 has 40 divisors (see below), whose sum is σ = 2835150384. Its totient is φ = 354739200.
The previous prime is 1064219129. The next prime is 1064219137. The reversal of 1064219136 is 6319124601.
1064219136 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10642191362 = 2265124738857172992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1064219097 and 1064219106.
It is not an unprimeable number, because it can be changed into a prime (1064219137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 344890 + ... + 347961.
Almost surely, 21064219136 is an apocalyptic number.
1064219136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1064219136 is an abundant number, since it is smaller than the sum of its proper divisors (1770931248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064219136 is an frugal number, since it uses more digits than its factorization.
1064219136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692872 (or 692856 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 1064219136 is about 32622.3717102236. The cubic root of 1064219136 is about 1020.9638256080.
The spelling of 1064219136 in words is "one billion, sixty-four million, two hundred nineteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •