Base | Representation |
---|---|
bin | 10011000011110000… |
… | …11100001011010101 |
3 | 222102002112112221012 |
4 | 21201320130023111 |
5 | 131423410320041 |
6 | 4411153502005 |
7 | 511363404464 |
oct | 114170341325 |
9 | 28362475835 |
10 | 10232120021 |
11 | 4380846242 |
12 | 1b96871905 |
13 | c70b0c6b6 |
14 | 6d0d069db |
15 | 3ed45e3eb |
hex | 261e1c2d5 |
10232120021 has 4 divisors (see below), whose sum is σ = 10834009452. Its totient is φ = 9630230592.
The previous prime is 10232120011. The next prime is 10232120029. The reversal of 10232120021 is 12002123201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4051959025 + 6180160996 = 63655^2 + 78614^2 .
It is a cyclic number.
It is not a de Polignac number, because 10232120021 - 218 = 10231857877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10232119978 and 10232120005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232120029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300944690 + ... + 300944723.
It is an arithmetic number, because the mean of its divisors is an integer number (2708502363).
Almost surely, 210232120021 is an apocalyptic number.
It is an amenable number.
10232120021 is a deficient number, since it is larger than the sum of its proper divisors (601889431).
10232120021 is an equidigital number, since it uses as much as digits as its factorization.
10232120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601889430.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10232120021 its reverse (12002123201), we get a palindrome (22234243222).
The spelling of 10232120021 in words is "ten billion, two hundred thirty-two million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •