Base | Representation |
---|---|
bin | 10111000000111101101101… |
… | …011111000011011101100011 |
3 | 111021101122221121021220122102 |
4 | 113000331231133003131203 |
5 | 101231402241231401034 |
6 | 555140234303201015 |
7 | 30214666642323353 |
oct | 2700755537033543 |
9 | 437348847256572 |
10 | 101221331122019 |
11 | 2a2857a8646a29 |
12 | b429456ba616b |
13 | 4463190b1c134 |
14 | 1add1d2324b63 |
15 | ba7eec01297e |
hex | 5c0f6d7c3763 |
101221331122019 has 4 divisors (see below), whose sum is σ = 101221352639544. Its totient is φ = 101221309604496.
The previous prime is 101221331122013. The next prime is 101221331122027. The reversal of 101221331122019 is 910221133122101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101221331122019 - 212 = 101221331117923 is a prime.
It is a super-2 number, since 2×1012213311220192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101221331121982 and 101221331122000.
It is not an unprimeable number, because it can be changed into a prime (101221331122013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 338282 + ... + 14232255.
It is an arithmetic number, because the mean of its divisors is an integer number (25305338159886).
Almost surely, 2101221331122019 is an apocalyptic number.
101221331122019 is a deficient number, since it is larger than the sum of its proper divisors (21517525).
101221331122019 is an equidigital number, since it uses as much as digits as its factorization.
101221331122019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21517524.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 101221331122019 in words is "one hundred one trillion, two hundred twenty-one billion, three hundred thirty-one million, one hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •