Base | Representation |
---|---|
bin | 10010101010101000… |
… | …11001000001100011 |
3 | 221212101220222200010 |
4 | 21111110121001203 |
5 | 131010430441311 |
6 | 4334224100003 |
7 | 503224004256 |
oct | 112524310143 |
9 | 27771828603 |
10 | 10021343331 |
11 | 428287262a |
12 | 1b38164603 |
13 | c3925116c |
14 | 6b0d1b09d |
15 | 3d9bc6da6 |
hex | 255519063 |
10021343331 has 4 divisors (see below), whose sum is σ = 13361791112. Its totient is φ = 6680895552.
The previous prime is 10021343323. The next prime is 10021343333. The reversal of 10021343331 is 13334312001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13334312001 = 3 ⋅4444770667.
It is not a de Polignac number, because 10021343331 - 23 = 10021343323 is a prime.
It is a super-2 number, since 2×100213433312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10021343298 and 10021343307.
It is not an unprimeable number, because it can be changed into a prime (10021343333) 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, 1670223886 + ... + 1670223891.
It is an arithmetic number, because the mean of its divisors is an integer number (3340447778).
Almost surely, 210021343331 is an apocalyptic number.
10021343331 is a deficient number, since it is larger than the sum of its proper divisors (3340447781).
10021343331 is an equidigital number, since it uses as much as digits as its factorization.
10021343331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3340447780.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10021343331 its reverse (13334312001), we get a palindrome (23355655332).
The spelling of 10021343331 in words is "ten billion, twenty-one million, three hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •