Base | Representation |
---|---|
bin | 10100011110001010… |
… | …00101000111000100 |
3 | 1001100221101120200001 |
4 | 22033011011013010 |
5 | 140002021030012 |
6 | 5014322331044 |
7 | 536231633134 |
oct | 121705050704 |
9 | 31327346601 |
10 | 10990408132 |
11 | 472a887330 |
12 | 21687b9a84 |
13 | 1061c497a2 |
14 | 7638d4ac4 |
15 | 444ce7357 |
hex | 28f1451c4 |
10990408132 has 24 divisors (see below), whose sum is σ = 22215906720. Its totient is φ = 4701778560.
The previous prime is 10990408103. The next prime is 10990408133. The reversal of 10990408132 is 23180409901.
It is a junction number, because it is equal to n+sod(n) for n = 10990408091 and 10990408100.
It is not an unprimeable number, because it can be changed into a prime (10990408133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7345782 + ... + 7347277.
It is an arithmetic number, because the mean of its divisors is an integer number (925662780).
Almost surely, 210990408132 is an apocalyptic number.
It is an amenable number.
10990408132 is an abundant number, since it is smaller than the sum of its proper divisors (11225498588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10990408132 is a wasteful number, since it uses less digits than its factorization.
10990408132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14693091 (or 14693089 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 37.
The spelling of 10990408132 in words is "ten billion, nine hundred ninety million, four hundred eight thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •