Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0000000011000111101 |
3 | 100200000022000002120001 |
4 | 1132023102000120331 |
5 | 3124043434013041 |
6 | 114242045554301 |
7 | 10206605220025 |
oct | 1361322003075 |
9 | 320008002501 |
10 | 101121001021 |
11 | 39981194827 |
12 | 17721275991 |
13 | 96c6b34361 |
14 | 4c73ca8a85 |
15 | 296c86d131 |
hex | 178b48063d |
101121001021 has 8 divisors (see below), whose sum is σ = 102552943104. Its totient is φ = 99689273040.
The previous prime is 101121001019. The next prime is 101121001099. The reversal of 101121001021 is 120100121101.
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 101121001021 - 21 = 101121001019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101121000989 and 101121001007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101121001921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1060695 + ... + 1152091.
It is an arithmetic number, because the mean of its divisors is an integer number (12819117888).
Almost surely, 2101121001021 is an apocalyptic number.
It is an amenable number.
101121001021 is a deficient number, since it is larger than the sum of its proper divisors (1431942083).
101121001021 is an equidigital number, since it uses as much as digits as its factorization.
101121001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107051.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101121001021 its reverse (120100121101), we get a palindrome (221221122122).
The spelling of 101121001021 in words is "one hundred one billion, one hundred twenty-one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •