Base | Representation |
---|---|
bin | 10110111101101111100110… |
… | …011011110011000110001101 |
3 | 111020121111201012011021222011 |
4 | 112331233212123303012031 |
5 | 101214241021113343201 |
6 | 554450434121021221 |
7 | 30163003462041136 |
oct | 2675574633630615 |
9 | 436544635137864 |
10 | 101000022012301 |
11 | 2a1aa9613a7255 |
12 | b3b2593024811 |
13 | 4448351b4aac9 |
14 | 1ad25da148c8d |
15 | ba2397e33151 |
hex | 5bdbe66f318d |
101000022012301 has 8 divisors (see below), whose sum is σ = 102049688825280. Its totient is φ = 99950527229568.
The previous prime is 101000022012289. The next prime is 101000022012319. The reversal of 101000022012301 is 103210220000101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101000022012301 - 229 = 100999485141389 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 (101000022012391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41827081 + ... + 44175838.
It is an arithmetic number, because the mean of its divisors is an integer number (12756211103160).
Almost surely, 2101000022012301 is an apocalyptic number.
It is an amenable number.
101000022012301 is a deficient number, since it is larger than the sum of its proper divisors (1049666812979).
101000022012301 is an equidigital number, since it uses as much as digits as its factorization.
101000022012301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86015123.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 101000022012301 its reverse (103210220000101), we get a palindrome (204210242012402).
The spelling of 101000022012301 in words is "one hundred one trillion, twenty-two million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •