Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0000110111100010100 |
3 | 101201002121201020122102 |
4 | 1220103312012330110 |
5 | 3313340014213022 |
6 | 123241505421232 |
7 | 11043342102434 |
oct | 1502366067424 |
9 | 351077636572 |
10 | 112002101012 |
11 | 435552a224a |
12 | 1985933a818 |
13 | a73c22b669 |
14 | 55c70682c4 |
15 | 2da7c72a92 |
hex | 1a13d86f14 |
112002101012 has 12 divisors (see below), whose sum is σ = 196008658356. Its totient is φ = 55999627200.
The previous prime is 112002100967. The next prime is 112002101021. The reversal of 112002101012 is 210101200211.
112002101012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 55792329616 + 56209771396 = 236204^2 + 237086^2 .
It is a super-2 number, since 2×1120021010122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112002100984 and 112002101002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167723 + ... + 502130.
It is an arithmetic number, because the mean of its divisors is an integer number (16334054863).
Almost surely, 2112002101012 is an apocalyptic number.
It is an amenable number.
112002101012 is a deficient number, since it is larger than the sum of its proper divisors (84006557344).
112002101012 is a wasteful number, since it uses less digits than its factorization.
112002101012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 711658 (or 711656 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112002101012 its reverse (210101200211), we get a palindrome (322103301223).
The spelling of 112002101012 in words is "one hundred twelve billion, two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •