Base | Representation |
---|---|
bin | 101110111110010010… |
… | …0100111100111001111 |
3 | 100122101002122102102110 |
4 | 1131330210213213033 |
5 | 3123042300101111 |
6 | 114201352355103 |
7 | 10200520511532 |
oct | 1357444474717 |
9 | 318332572373 |
10 | 100874222031 |
11 | 39864961050 |
12 | 176726a5a93 |
13 | 968797ba9b |
14 | 4c4d1caa19 |
15 | 2955d735a6 |
hex | 177c9279cf |
100874222031 has 16 divisors (see below), whose sum is σ = 149131490688. Its totient is φ = 60133663200.
The previous prime is 100874222027. The next prime is 100874222041. The reversal of 100874222031 is 130222478001.
It is not a de Polignac number, because 100874222031 - 22 = 100874222027 is a prime.
It is a super-2 number, since 2×1008742220312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100874222031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100874222041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25053681 + ... + 25057706.
It is an arithmetic number, because the mean of its divisors is an integer number (9320718168).
Almost surely, 2100874222031 is an apocalyptic number.
100874222031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100874222031 is a deficient number, since it is larger than the sum of its proper divisors (48257268657).
100874222031 is a wasteful number, since it uses less digits than its factorization.
100874222031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50111462.
The product of its (nonzero) digits is 5376, while the sum is 30.
The spelling of 100874222031 in words is "one hundred billion, eight hundred seventy-four million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •