Base | Representation |
---|---|
bin | 101110101000001010… |
… | …1110000110011100101 |
3 | 100120110101021020120012 |
4 | 1131100111300303211 |
5 | 3120032311130041 |
6 | 114000003020005 |
7 | 10143240030140 |
oct | 1352025606345 |
9 | 316411236505 |
10 | 100132130021 |
11 | 39513a82370 |
12 | 174a606a605 |
13 | 9599cc28a1 |
14 | 4bbc817057 |
15 | 2910b393eb |
hex | 1750570ce5 |
100132130021 has 8 divisors (see below), whose sum is σ = 124840058304. Its totient is φ = 78025036320.
The previous prime is 100132130011. The next prime is 100132130051. The reversal of 100132130021 is 120031231001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100132130021 - 230 = 99058388197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100132129978 and 100132130005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100132130011) 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, 650208560 + ... + 650208713.
It is an arithmetic number, because the mean of its divisors is an integer number (15605007288).
Almost surely, 2100132130021 is an apocalyptic number.
100132130021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100132130021 is a deficient number, since it is larger than the sum of its proper divisors (24707928283).
100132130021 is a wasteful number, since it uses less digits than its factorization.
100132130021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1300417291.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100132130021 its reverse (120031231001), we get a palindrome (220163361022).
The spelling of 100132130021 in words is "one hundred billion, one hundred thirty-two million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •