Base | Representation |
---|---|
bin | 110001111001010101… |
… | …1111110100110010100 |
3 | 101020120112012010212020 |
4 | 1203302223332212110 |
5 | 3223421103024342 |
6 | 121120250053140 |
7 | 10512204012204 |
oct | 1436253764624 |
9 | 336515163766 |
10 | 107150829972 |
11 | 4149593953a |
12 | 1892471a1b0 |
13 | a148145294 |
14 | 5286a40404 |
15 | 2bc1de90ec |
hex | 18f2afe994 |
107150829972 has 24 divisors (see below), whose sum is σ = 250678293600. Its totient is φ = 35622701856.
The previous prime is 107150829911. The next prime is 107150829979. The reversal of 107150829972 is 279928051701.
It is a super-2 number, since 2×1071508299722 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107150829979) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11775447 + ... + 11784542.
It is an arithmetic number, because the mean of its divisors is an integer number (10444928900).
Almost surely, 2107150829972 is an apocalyptic number.
107150829972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107150829972 is an abundant number, since it is smaller than the sum of its proper divisors (143527463628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107150829972 is a wasteful number, since it uses less digits than its factorization.
107150829972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23560375 (or 23560373 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 51.
The spelling of 107150829972 in words is "one hundred seven billion, one hundred fifty million, eight hundred twenty-nine thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •