Base | Representation |
---|---|
bin | 10100010100101100… |
… | …01101010100000100 |
3 | 1001011101222211210021 |
4 | 22022112031110010 |
5 | 134321204341400 |
6 | 5002404504524 |
7 | 534246033622 |
oct | 121226152404 |
9 | 31141884707 |
10 | 10911012100 |
11 | 4699a8897a |
12 | 21460ab144 |
13 | 104b66b2a1 |
14 | 757148512 |
15 | 43cd6271a |
hex | 28a58d504 |
10911012100 has 72 divisors (see below), whose sum is σ = 23846676840. Its totient is φ = 4333240320.
The previous prime is 10911012043. The next prime is 10911012107. The reversal of 10911012100 is 121011901.
It can be written as a sum of positive squares in 12 ways, for example, as 1098524736 + 9812487364 = 33144^2 + 99058^2 .
It is not an unprimeable number, because it can be changed into a prime (10911012107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11744436 + ... + 11745364.
It is an arithmetic number, because the mean of its divisors is an integer number (331203845).
Almost surely, 210911012100 is an apocalyptic number.
10911012100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10911012100 is an abundant number, since it is smaller than the sum of its proper divisors (12935664740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10911012100 is a wasteful number, since it uses less digits than its factorization.
10911012100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1657 (or 1650 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 16.
The spelling of 10911012100 in words is "ten billion, nine hundred eleven million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •