Base | Representation |
---|---|
bin | 10100011110111101… |
… | …00101001000001000 |
3 | 1001101101222012102000 |
4 | 22033132211020020 |
5 | 140010223432442 |
6 | 5015121511000 |
7 | 536342514153 |
oct | 121736451010 |
9 | 31341865360 |
10 | 10997092872 |
11 | 4733632707 |
12 | 216aaa2460 |
13 | 106344a35c |
14 | 764754c9a |
15 | 4456b7d4c |
hex | 28f7a5208 |
10997092872 has 128 divisors (see below), whose sum is σ = 32800723200. Its totient is φ = 3401395200.
The previous prime is 10997092837. The next prime is 10997092877. The reversal of 10997092872 is 27829079901.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (10997092877) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239622 + ... + 281802.
It is an arithmetic number, because the mean of its divisors is an integer number (256255650).
Almost surely, 210997092872 is an apocalyptic number.
10997092872 is a gapful number since it is divisible by the number (12) 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 10997092872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16400361600).
10997092872 is an abundant number, since it is smaller than the sum of its proper divisors (21803630328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10997092872 is a wasteful number, since it uses less digits than its factorization.
10997092872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42284 (or 42274 counting only the distinct ones).
The product of its (nonzero) digits is 1143072, while the sum is 54.
The spelling of 10997092872 in words is "ten billion, nine hundred ninety-seven million, ninety-two thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •