Base | Representation |
---|---|
bin | 10110111110000100001011… |
… | …101001111001101111100101 |
3 | 111020200121202022212120200202 |
4 | 112332010023221321233211 |
5 | 101220121301023144023 |
6 | 554504531041320245 |
7 | 30164415224646131 |
oct | 2676041351715745 |
9 | 436617668776622 |
10 | 101022121303013 |
11 | 2a20927191a479 |
12 | b3b6920036085 |
13 | 444a4644257a1 |
14 | 1ad36d51743c1 |
15 | ba2c3d126128 |
hex | 5be10ba79be5 |
101022121303013 has 8 divisors (see below), whose sum is σ = 101111802901920. Its totient is φ = 100932477898000.
The previous prime is 101022121302983. The next prime is 101022121303079. The reversal of 101022121303013 is 310303121220101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101022121303013 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 (101022121308013) 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, 4254863 + ... + 14837388.
It is an arithmetic number, because the mean of its divisors is an integer number (12638975362740).
Almost surely, 2101022121303013 is an apocalyptic number.
It is an amenable number.
101022121303013 is a deficient number, since it is larger than the sum of its proper divisors (89681598907).
101022121303013 is a wasteful number, since it uses less digits than its factorization.
101022121303013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19096947.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 101022121303013 its reverse (310303121220101), we get a palindrome (411325242523114).
The spelling of 101022121303013 in words is "one hundred one trillion, twenty-two billion, one hundred twenty-one million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •