Base | Representation |
---|---|
bin | 110001100010000111… |
… | …0110110101011010100 |
3 | 101011120012122012111100 |
4 | 1203010032312223110 |
5 | 3220322042142122 |
6 | 120511045110100 |
7 | 10453661231163 |
oct | 1430416665324 |
9 | 334505565440 |
10 | 106371443412 |
11 | 411259a7913 |
12 | 187476b8330 |
13 | a05282bac0 |
14 | 521131d3da |
15 | 2b78794aac |
hex | 18c43b6ad4 |
106371443412 has 72 divisors (see below), whose sum is σ = 297392882696. Its totient is φ = 31845083904.
The previous prime is 106371443377. The next prime is 106371443489. The reversal of 106371443412 is 214344173601.
106371443412 is a `hidden beast` number, since 1 + 0 + 637 + 1 + 4 + 4 + 3 + 4 + 12 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 44014361616 + 62357081796 = 209796^2 + 249714^2 .
It is a super-2 number, since 2×1063714434122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3054163 + ... + 3088794.
Almost surely, 2106371443412 is an apocalyptic number.
106371443412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106371443412 is an abundant number, since it is smaller than the sum of its proper divisors (191021439284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106371443412 is a wasteful number, since it uses less digits than its factorization.
106371443412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6143017 (or 6143012 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The spelling of 106371443412 in words is "one hundred six billion, three hundred seventy-one million, four hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •