Base | Representation |
---|---|
bin | 10011100100100011… |
… | …001111110000111001 |
3 | 2000020112010202112110 |
4 | 103210203033300321 |
5 | 321014131022131 |
6 | 13353121402533 |
7 | 1342516502460 |
oct | 234443176071 |
9 | 60215122473 |
10 | 21014314041 |
11 | 8a0403a196 |
12 | 40a5799449 |
13 | 1c9b887166 |
14 | 1034cbb9d7 |
15 | 82ed28646 |
hex | 4e48cfc39 |
21014314041 has 16 divisors (see below), whose sum is σ = 32266257408. Its totient is φ = 11916512400.
The previous prime is 21014314033. The next prime is 21014314099. The reversal of 21014314041 is 14041341012.
It is not a de Polignac number, because 21014314041 - 23 = 21014314033 is a prime.
It is a super-2 number, since 2×210143140412 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 21014313999 and 21014314017.
It is not an unprimeable number, because it can be changed into a prime (21014314031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3816645 + ... + 3822146.
It is an arithmetic number, because the mean of its divisors is an integer number (2016641088).
Almost surely, 221014314041 is an apocalyptic number.
21014314041 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21014314041 is a deficient number, since it is larger than the sum of its proper divisors (11251943367).
21014314041 is a wasteful number, since it uses less digits than its factorization.
21014314041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7638932.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 21014314041 its reverse (14041341012), we get a palindrome (35055655053).
The spelling of 21014314041 in words is "twenty-one billion, fourteen million, three hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •