Base | Representation |
---|---|
bin | 10011000001110000… |
… | …10100001110001101 |
3 | 222100220220112020000 |
4 | 21200320110032031 |
5 | 131410104411341 |
6 | 4405353314513 |
7 | 511100463354 |
oct | 114070241615 |
9 | 28326815200 |
10 | 10215310221 |
11 | 4372304846 |
12 | 1b91105a39 |
13 | c6a4a537c |
14 | 6cc9ac99b |
15 | 3ebc3d8b6 |
hex | 260e1438d |
10215310221 has 40 divisors (see below), whose sum is σ = 15395919000. Its totient is φ = 6749723520.
The previous prime is 10215310087. The next prime is 10215310243. The reversal of 10215310221 is 12201351201.
It can be written as a sum of positive squares in 4 ways, for example, as 644601321 + 9570708900 = 25389^2 + 97830^2 .
It is not a de Polignac number, because 10215310221 - 213 = 10215302029 is a prime.
It is a super-2 number, since 2×102153102212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10215310194 and 10215310203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10215318221) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 10004691 + ... + 10005711.
It is an arithmetic number, because the mean of its divisors is an integer number (384897975).
Almost surely, 210215310221 is an apocalyptic number.
It is an amenable number.
10215310221 is a deficient number, since it is larger than the sum of its proper divisors (5180608779).
10215310221 is a wasteful number, since it uses less digits than its factorization.
10215310221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2011 (or 2002 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 10215310221 its reverse (12201351201), we get a palindrome (22416661422).
The spelling of 10215310221 in words is "ten billion, two hundred fifteen million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •