Base | Representation |
---|---|
bin | 10010110100001010… |
… | …11001111111100101 |
3 | 222001222101021021110 |
4 | 21122011121333211 |
5 | 131141413114341 |
6 | 4350201535233 |
7 | 505214433534 |
oct | 113205317745 |
9 | 28058337243 |
10 | 10101301221 |
11 | 4313a15130 |
12 | 1b5aaa4519 |
13 | c4c99831b |
14 | 6bb7b231b |
15 | 3e1c1d216 |
hex | 25a159fe5 |
10101301221 has 8 divisors (see below), whose sum is σ = 14692801824. Its totient is φ = 6122000720.
The previous prime is 10101301219. The next prime is 10101301307. The reversal of 10101301221 is 12210310101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10101301221 - 21 = 10101301219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101301197 and 10101301206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101301201) 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, 153049986 + ... + 153050051.
It is an arithmetic number, because the mean of its divisors is an integer number (1836600228).
Almost surely, 210101301221 is an apocalyptic number.
10101301221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10101301221 is a deficient number, since it is larger than the sum of its proper divisors (4591500603).
10101301221 is a wasteful number, since it uses less digits than its factorization.
10101301221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306100051.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10101301221 its reverse (12210310101), we get a palindrome (22311611322).
The spelling of 10101301221 in words is "ten billion, one hundred one million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •