Base | Representation |
---|---|
bin | 10111000010100100110011… |
… | …101010100100101111101101 |
3 | 111021210020200102011101200210 |
4 | 113002210303222210233231 |
5 | 101240210444213304401 |
6 | 555303143025013033 |
7 | 30225666113141262 |
oct | 2702446352445755 |
9 | 437706612141623 |
10 | 101332030213101 |
11 | 2a318744375566 |
12 | b4469aba84179 |
13 | 44707530ca7ac |
14 | 1b046d42c7269 |
15 | baad2a69d4d6 |
hex | 5c2933aa4bed |
101332030213101 has 8 divisors (see below), whose sum is σ = 138760978309984. Its totient is φ = 65728884462480.
The previous prime is 101332030213093. The next prime is 101332030213129. The reversal of 101332030213101 is 101312030233101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101332030213101 - 23 = 101332030213093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101332030211101) 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, 456450586435 + ... + 456450586656.
It is an arithmetic number, because the mean of its divisors is an integer number (17345122288748).
Almost surely, 2101332030213101 is an apocalyptic number.
It is an amenable number.
101332030213101 is a deficient number, since it is larger than the sum of its proper divisors (37428948096883).
101332030213101 is an equidigital number, since it uses as much as digits as its factorization.
101332030213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912901173131.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 101332030213101 its reverse (101312030233101), we get a palindrome (202644060446202).
The spelling of 101332030213101 in words is "one hundred one trillion, three hundred thirty-two billion, thirty million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •