Base | Representation |
---|---|
bin | 10111000010100100110001… |
… | …110111110010100010001110 |
3 | 111021210020121022112122212102 |
4 | 113002210301313302202032 |
5 | 101240210414012414042 |
6 | 555303140032035102 |
7 | 30225665266316144 |
oct | 2702446167624216 |
9 | 437706538478772 |
10 | 101332000123022 |
11 | 2a318729393429 |
12 | b4469a1992a92 |
13 | 4470749ac3806 |
14 | 1b046d02d3594 |
15 | baad27c07b32 |
hex | 5c2931df288e |
101332000123022 has 4 divisors (see below), whose sum is σ = 151998000184536. Its totient is φ = 50666000061510.
The previous prime is 101332000122971. The next prime is 101332000123063. The reversal of 101332000123022 is 220321000233101.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 101332000122985 and 101332000123003.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25333000030754 + ... + 25333000030757.
It is an arithmetic number, because the mean of its divisors is an integer number (37999500046134).
Almost surely, 2101332000123022 is an apocalyptic number.
101332000123022 is a deficient number, since it is larger than the sum of its proper divisors (50666000061514).
101332000123022 is an equidigital number, since it uses as much as digits as its factorization.
101332000123022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50666000061513.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 101332000123022 its reverse (220321000233101), we get a palindrome (321653000356123).
The spelling of 101332000123022 in words is "one hundred one trillion, three hundred thirty-two billion, one hundred twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •