Base | Representation |
---|---|
bin | 10011001101010010… |
… | …01010001011011101 |
3 | 222121122211212222010 |
4 | 21212221022023131 |
5 | 132104333001341 |
6 | 4423125541433 |
7 | 513353361405 |
oct | 114651121335 |
9 | 28548755863 |
10 | 10312000221 |
11 | 4411945436 |
12 | 1bb9574879 |
13 | c8452a3a3 |
14 | 6db77b805 |
15 | 40548c716 |
hex | 266a4a2dd |
10312000221 has 16 divisors (see below), whose sum is σ = 14073028736. Its totient is φ = 6714648576.
The previous prime is 10312000189. The next prime is 10312000273. The reversal of 10312000221 is 12200021301.
10312000221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10312000221 - 25 = 10312000189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10312000197 and 10312000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10312000121) 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 15 ways as a sum of consecutive naturals, for example, 206020 + ... + 251133.
It is an arithmetic number, because the mean of its divisors is an integer number (879564296).
Almost surely, 210312000221 is an apocalyptic number.
It is an amenable number.
10312000221 is a deficient number, since it is larger than the sum of its proper divisors (3761028515).
10312000221 is a wasteful number, since it uses less digits than its factorization.
10312000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457332.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10312000221 its reverse (12200021301), we get a palindrome (22512021522).
The spelling of 10312000221 in words is "ten billion, three hundred twelve million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •