Base | Representation |
---|---|
bin | 110000100001110001… |
… | …0001001101011011000 |
3 | 100221222201201100202210 |
4 | 1201003202021223120 |
5 | 3201411313203422 |
6 | 115512513555120 |
7 | 10346322301560 |
oct | 1410342115330 |
9 | 327881640683 |
10 | 104212241112 |
11 | 40218103201 |
12 | 18244575aa0 |
13 | 9a9a3b30c5 |
14 | 5088661da0 |
15 | 2a9de3610c |
hex | 1843889ad8 |
104212241112 has 64 divisors (see below), whose sum is σ = 298706803200. Its totient is φ = 29679171840.
The previous prime is 104212241101. The next prime is 104212241123. The reversal of 104212241112 is 211142212401.
It is an interprime number because it is at equal distance from previous prime (104212241101) and next prime (104212241123).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 945037 + ... + 1049532.
It is an arithmetic number, because the mean of its divisors is an integer number (4667293800).
Almost surely, 2104212241112 is an apocalyptic number.
104212241112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104212241112 is an abundant number, since it is smaller than the sum of its proper divisors (194494562088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104212241112 is a wasteful number, since it uses less digits than its factorization.
104212241112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1994896 (or 1994892 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 104212241112 its reverse (211142212401), we get a palindrome (315354453513).
The spelling of 104212241112 in words is "one hundred four billion, two hundred twelve million, two hundred forty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •