Base | Representation |
---|---|
bin | 10011011100110011… |
… | …10101100011101001 |
3 | 222221201211210022002 |
4 | 21232121311203221 |
5 | 132341200420241 |
6 | 4444100340345 |
7 | 516524150426 |
oct | 115631654351 |
9 | 28851753262 |
10 | 10442201321 |
11 | 4479394452 |
12 | 20350a46b5 |
13 | ca54b6566 |
14 | 710b90d4d |
15 | 411b0a89b |
hex | 26e6758e9 |
10442201321 has 4 divisors (see below), whose sum is σ = 10442550144. Its totient is φ = 10441852500.
The previous prime is 10442201299. The next prime is 10442201323. The reversal of 10442201321 is 12310224401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10442201321 - 210 = 10442200297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10442201293 and 10442201302.
It is not an unprimeable number, because it can be changed into a prime (10442201323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 124805 + ... + 190946.
It is an arithmetic number, because the mean of its divisors is an integer number (2610637536).
Almost surely, 210442201321 is an apocalyptic number.
It is an amenable number.
10442201321 is a deficient number, since it is larger than the sum of its proper divisors (348823).
10442201321 is an equidigital number, since it uses as much as digits as its factorization.
10442201321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348822.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10442201321 its reverse (12310224401), we get a palindrome (22752425722).
The spelling of 10442201321 in words is "ten billion, four hundred forty-two million, two hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •