Base | Representation |
---|---|
bin | 10011000010101100… |
… | …00100101101101101 |
3 | 222101110120211220112 |
4 | 21201112010231231 |
5 | 131414104023041 |
6 | 4410232425405 |
7 | 511224003254 |
oct | 114126045555 |
9 | 28343524815 |
10 | 10223111021 |
11 | 4376752692 |
12 | 1b93848265 |
13 | c6bca6c26 |
14 | 6cda3d79b |
15 | 3ec77edeb |
hex | 261584b6d |
10223111021 has 8 divisors (see below), whose sum is σ = 10326403704. Its totient is φ = 10119859200.
The previous prime is 10223110969. The next prime is 10223111053. The reversal of 10223111021 is 12011132201.
It can be written as a sum of positive squares in 4 ways, for example, as 6405601225 + 3817509796 = 80035^2 + 61786^2 .
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 10223111021 - 210 = 10223109997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10223110987 and 10223111005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223111081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 874205 + ... + 885821.
It is an arithmetic number, because the mean of its divisors is an integer number (1290800463).
Almost surely, 210223111021 is an apocalyptic number.
It is an amenable number.
10223111021 is a deficient number, since it is larger than the sum of its proper divisors (103292683).
10223111021 is a wasteful number, since it uses less digits than its factorization.
10223111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20431.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10223111021 its reverse (12011132201), we get a palindrome (22234243222).
The spelling of 10223111021 in words is "ten billion, two hundred twenty-three million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •