Base | Representation |
---|---|
bin | 10011111010100101… |
… | …10111111110110000 |
3 | 1000121010221121222001 |
4 | 21331102313332300 |
5 | 133344130100410 |
6 | 4524543223344 |
7 | 525646536121 |
oct | 117522677660 |
9 | 30533847861 |
10 | 10692034480 |
11 | 4597413836 |
12 | 20a48a7b54 |
13 | 101519b02a |
14 | 736026048 |
15 | 428a0a33a |
hex | 27d4b7fb0 |
10692034480 has 80 divisors (see below), whose sum is σ = 25212582720. Its totient is φ = 4216356864.
The previous prime is 10692034469. The next prime is 10692034501. The reversal of 10692034480 is 8443029601.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×106920344802 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1917136 + ... + 1922704.
It is an arithmetic number, because the mean of its divisors is an integer number (315157284).
Almost surely, 210692034480 is an apocalyptic number.
10692034480 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 10692034480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12606291360).
10692034480 is an abundant number, since it is smaller than the sum of its proper divisors (14520548240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10692034480 is a wasteful number, since it uses less digits than its factorization.
10692034480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5918 (or 5912 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 10692034480 in words is "ten billion, six hundred ninety-two million, thirty-four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •