Base | Representation |
---|---|
bin | 10110110000110010110100… |
… | …110011000100100011000101 |
3 | 111010110102202011021010002020 |
4 | 112300302310303010203011 |
5 | 101110201022020201041 |
6 | 552525543112433353 |
7 | 30041501241321141 |
oct | 2660626463044305 |
9 | 433412664233066 |
10 | 100110131022021 |
11 | 2999751710704a |
12 | b28a0203a8859 |
13 | 43b2463828873 |
14 | 1aa14db580221 |
15 | b89163148866 |
hex | 5b0cb4cc48c5 |
100110131022021 has 8 divisors (see below), whose sum is σ = 133838030393760. Its totient is φ = 66561159499152.
The previous prime is 100110131021983. The next prime is 100110131022067. The reversal of 100110131022021 is 120220131011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100110131022021 - 223 = 100110122633413 is a prime.
It is a super-2 number, since 2×1001101310220212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110131022521) 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, 44731960911 + ... + 44731963148.
It is an arithmetic number, because the mean of its divisors is an integer number (16729753799220).
Almost surely, 2100110131022021 is an apocalyptic number.
It is an amenable number.
100110131022021 is a deficient number, since it is larger than the sum of its proper divisors (33727899371739).
100110131022021 is an equidigital number, since it uses as much as digits as its factorization.
100110131022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89463924435.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 100110131022021 its reverse (120220131011001), we get a palindrome (220330262033022).
The spelling of 100110131022021 in words is "one hundred trillion, one hundred ten billion, one hundred thirty-one million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •