Base | Representation |
---|---|
bin | 10011011100110111… |
… | …10100100011111101 |
3 | 222221202211012220012 |
4 | 21232123310203331 |
5 | 132341314042113 |
6 | 4444115433005 |
7 | 516531445166 |
oct | 115633644375 |
9 | 28852735805 |
10 | 10442721533 |
11 | 447970a282 |
12 | 20352b5765 |
13 | ca563928a |
14 | 710c8876d |
15 | 411baeaa8 |
hex | 26e6f48fd |
10442721533 has 4 divisors (see below), whose sum is σ = 10896752928. Its totient is φ = 9988690140.
The previous prime is 10442721521. The next prime is 10442721557. The reversal of 10442721533 is 33512724401.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33512724401 = 13 ⋅2577901877.
It is a cyclic number.
It is not a de Polignac number, because 10442721533 - 24 = 10442721517 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10442721533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10442721503) 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, 227015663 + ... + 227015708.
It is an arithmetic number, because the mean of its divisors is an integer number (2724188232).
Almost surely, 210442721533 is an apocalyptic number.
It is an amenable number.
10442721533 is a deficient number, since it is larger than the sum of its proper divisors (454031395).
10442721533 is an equidigital number, since it uses as much as digits as its factorization.
10442721533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454031394.
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 10442721533 in words is "ten billion, four hundred forty-two million, seven hundred twenty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •