Base | Representation |
---|---|
bin | 10011011010010010… |
… | …00000111000010001 |
3 | 222220020222100210201 |
4 | 21231021000320101 |
5 | 132320234422113 |
6 | 4442022255201 |
7 | 516146105053 |
oct | 115511007021 |
9 | 28806870721 |
10 | 10421014033 |
11 | 44684330a1 |
12 | 2029b87501 |
13 | ca0ca88c1 |
14 | 70c0378d3 |
15 | 40ed22cdd |
hex | 26d240e11 |
10421014033 has 4 divisors (see below), whose sum is σ = 10757175808. Its totient is φ = 10084852260.
The previous prime is 10421013983. The next prime is 10421014039. The reversal of 10421014033 is 33041012401.
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 10421014033 - 221 = 10418916881 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 10421014033.
It is not an unprimeable number, because it can be changed into a prime (10421014039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168080841 + ... + 168080902.
It is an arithmetic number, because the mean of its divisors is an integer number (2689293952).
Almost surely, 210421014033 is an apocalyptic number.
It is an amenable number.
10421014033 is a deficient number, since it is larger than the sum of its proper divisors (336161775).
10421014033 is an equidigital number, since it uses as much as digits as its factorization.
10421014033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336161774.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10421014033 its reverse (33041012401), we get a palindrome (43462026434).
The spelling of 10421014033 in words is "ten billion, four hundred twenty-one million, fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •