Base | Representation |
---|---|
bin | 101111001000100111… |
… | …1100011010111000001 |
3 | 100200021021012122100012 |
4 | 1132101033203113001 |
5 | 3124300040133441 |
6 | 114300021434305 |
7 | 10212231324563 |
oct | 1362117432701 |
9 | 320237178305 |
10 | 101221021121 |
11 | 39a2269a370 |
12 | 1774a86b995 |
13 | 971178404c |
14 | 4c832a3333 |
15 | 29765289eb |
hex | 17913e35c1 |
101221021121 has 16 divisors (see below), whose sum is σ = 117107415360. Its totient is φ = 86466209280.
The previous prime is 101221021091. The next prime is 101221021129. The reversal of 101221021121 is 121120122101.
It is not a de Polignac number, because 101221021121 - 214 = 101221004737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101221021096 and 101221021105.
It is not an unprimeable number, because it can be changed into a prime (101221021129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 321476 + ... + 552981.
It is an arithmetic number, because the mean of its divisors is an integer number (7319213460).
Almost surely, 2101221021121 is an apocalyptic number.
101221021121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101221021121 is a deficient number, since it is larger than the sum of its proper divisors (15886394239).
101221021121 is a wasteful number, since it uses less digits than its factorization.
101221021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875104.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101221021121 its reverse (121120122101), we get a palindrome (222341143222).
The spelling of 101221021121 in words is "one hundred one billion, two hundred twenty-one million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •