Base | Representation |
---|---|
bin | 10000001001111110111… |
… | …011001100101110100100 |
3 | 10221010200220111221021220 |
4 | 100021332323030232210 |
5 | 121142223114311322 |
6 | 2210011051340340 |
7 | 143132362610442 |
oct | 20117673145644 |
9 | 3833626457256 |
10 | 1110231010212 |
11 | 398934509435 |
12 | 15b2061516b0 |
13 | 809045b977c |
14 | 3ba421a1b92 |
15 | 1dd2dc9155c |
hex | 1027eeccba4 |
1110231010212 has 24 divisors (see below), whose sum is σ = 2597484179136. Its totient is φ = 369084838368.
The previous prime is 1110231010199. The next prime is 1110231010223. The reversal of 1110231010212 is 2120101320111.
It is a super-2 number, since 2×11102310102122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110231010191 and 1110231010200.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 124015968 + ... + 124024919.
It is an arithmetic number, because the mean of its divisors is an integer number (108228507464).
Almost surely, 21110231010212 is an apocalyptic number.
1110231010212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1110231010212 is an abundant number, since it is smaller than the sum of its proper divisors (1487253168924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110231010212 is a wasteful number, since it uses less digits than its factorization.
1110231010212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248041267 (or 248041265 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1110231010212 its reverse (2120101320111), we get a palindrome (3230332330323).
The spelling of 1110231010212 in words is "one trillion, one hundred ten billion, two hundred thirty-one million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •