Base | Representation |
---|---|
bin | 101111000010001000… |
… | …0010111110100111101 |
3 | 100122201002012201221221 |
4 | 1132010100113310331 |
5 | 3123323300212341 |
6 | 114222235353341 |
7 | 10203644313145 |
oct | 1360420276475 |
9 | 318632181857 |
10 | 101003132221 |
11 | 399206a91a2 |
12 | 176a98b2851 |
13 | 96a85a54c4 |
14 | 4c62385925 |
15 | 2962338ed1 |
hex | 1784417d3d |
101003132221 has 8 divisors (see below), whose sum is σ = 101737328000. Its totient is φ = 100269044640.
The previous prime is 101003132177. The next prime is 101003132297. The reversal of 101003132221 is 122231300101.
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 101003132221 - 215 = 101003099453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101003132195 and 101003132204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101003132521) 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 7 ways as a sum of consecutive naturals, for example, 3578956 + ... + 3607066.
It is an arithmetic number, because the mean of its divisors is an integer number (12717166000).
Almost surely, 2101003132221 is an apocalyptic number.
It is an amenable number.
101003132221 is a deficient number, since it is larger than the sum of its proper divisors (734195779).
101003132221 is a wasteful number, since it uses less digits than its factorization.
101003132221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54099.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101003132221 its reverse (122231300101), we get a palindrome (223234432322).
The spelling of 101003132221 in words is "one hundred one billion, three million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •