Base | Representation |
---|---|
bin | 10011000001010001… |
… | …10000010110001000 |
3 | 222100122020021201220 |
4 | 21200220300112020 |
5 | 131403033343422 |
6 | 4405130042040 |
7 | 511021014045 |
oct | 114050602610 |
9 | 28318207656 |
10 | 10211231112 |
11 | 436aa79085 |
12 | 1b8b879320 |
13 | c696a77b4 |
14 | 6cc22a1cc |
15 | 3eb6d4e5c |
hex | 260a30588 |
10211231112 has 32 divisors (see below), whose sum is σ = 26351566080. Its totient is φ = 3293945280.
The previous prime is 10211231089. The next prime is 10211231117. The reversal of 10211231112 is 21113211201.
It is a junction number, because it is equal to n+sod(n) for n = 10211231091 and 10211231100.
It is not an unprimeable number, because it can be changed into a prime (10211231117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6861643 + ... + 6863130.
It is an arithmetic number, because the mean of its divisors is an integer number (823486440).
Almost surely, 210211231112 is an apocalyptic number.
10211231112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10211231112 is an abundant number, since it is smaller than the sum of its proper divisors (16140334968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211231112 is a wasteful number, since it uses less digits than its factorization.
10211231112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13724813 (or 13724809 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10211231112 its reverse (21113211201), we get a palindrome (31324442313).
The spelling of 10211231112 in words is "ten billion, two hundred eleven million, two hundred thirty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •