Base | Representation |
---|---|
bin | 10011110110011111… |
… | …010000111010001001 |
3 | 2001000111102101211121 |
4 | 103312133100322021 |
5 | 322123201310131 |
6 | 13443031555241 |
7 | 1353132502165 |
oct | 236637207211 |
9 | 61014371747 |
10 | 21315260041 |
11 | 90489aa399 |
12 | 416a52bb21 |
13 | 201902670a |
14 | 1062c59ca5 |
15 | 84b472911 |
hex | 4f67d0e89 |
21315260041 has 4 divisors (see below), whose sum is σ = 21320396692. Its totient is φ = 21310123392.
The previous prime is 21315260039. The next prime is 21315260047. The reversal of 21315260041 is 14006251312.
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 7415793225 + 13899466816 = 86115^2 + 117896^2 .
It is a cyclic number.
It is not a de Polignac number, because 21315260041 - 21 = 21315260039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21315259988 and 21315260015.
It is not an unprimeable number, because it can be changed into a prime (21315260047) 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, 2562096 + ... + 2570401.
It is an arithmetic number, because the mean of its divisors is an integer number (5330099173).
Almost surely, 221315260041 is an apocalyptic number.
It is an amenable number.
21315260041 is a deficient number, since it is larger than the sum of its proper divisors (5136651).
21315260041 is an equidigital number, since it uses as much as digits as its factorization.
21315260041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5136650.
The product of its (nonzero) digits is 1440, while the sum is 25.
The spelling of 21315260041 in words is "twenty-one billion, three hundred fifteen million, two hundred sixty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •