Base | Representation |
---|---|
bin | 10011001110011111… |
… | …10001010100100101 |
3 | 222122100220010110121 |
4 | 21213033301110211 |
5 | 132114430401041 |
6 | 4424130521541 |
7 | 513535406131 |
oct | 114717612445 |
9 | 28570803417 |
10 | 10322122021 |
11 | 4417629062 |
12 | 2000a362b1 |
13 | c86662513 |
14 | 6dcc543c1 |
15 | 4062db7d1 |
hex | 2673f1525 |
10322122021 has 4 divisors (see below), whose sum is σ = 10337460172. Its totient is φ = 10306783872.
The previous prime is 10322121967. The next prime is 10322122051. The reversal of 10322122021 is 12022122301.
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 6708429025 + 3613692996 = 81905^2 + 60114^2 .
It is a cyclic number.
It is not a de Polignac number, because 10322122021 - 217 = 10321990949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10322121986 and 10322122004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10322122051) 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, 7668066 + ... + 7669411.
It is an arithmetic number, because the mean of its divisors is an integer number (2584365043).
Almost surely, 210322122021 is an apocalyptic number.
It is an amenable number.
10322122021 is a deficient number, since it is larger than the sum of its proper divisors (15338151).
10322122021 is an equidigital number, since it uses as much as digits as its factorization.
10322122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15338150.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 10322122021 its reverse (12022122301), we get a palindrome (22344244322).
The spelling of 10322122021 in words is "ten billion, three hundred twenty-two million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •