Base | Representation |
---|---|
bin | 11001101101000… |
… | …01100111001001 |
3 | 120000201122002110 |
4 | 30312201213021 |
5 | 420144320131 |
6 | 33221252533 |
7 | 5225511600 |
oct | 1466414711 |
9 | 500648073 |
10 | 215620041 |
11 | 10079158a |
12 | 60264149 |
13 | 35895c30 |
14 | 208caa37 |
15 | 13de2646 |
hex | cda19c9 |
215620041 has 24 divisors (see below), whose sum is σ = 360159744. Its totient is φ = 113732640.
The previous prime is 215619967. The next prime is 215620057. The reversal of 215620041 is 140026512.
215620041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 215620041 - 218 = 215357897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (215620241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54505 + ... + 58326.
It is an arithmetic number, because the mean of its divisors is an integer number (15006656).
Almost surely, 2215620041 is an apocalyptic number.
215620041 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
215620041 is a deficient number, since it is larger than the sum of its proper divisors (144539703).
215620041 is a wasteful number, since it uses less digits than its factorization.
215620041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112861 (or 112854 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 215620041 is about 14684.0062993721. The cubic root of 215620041 is about 599.6479796209.
Adding to 215620041 its reverse (140026512), we get a palindrome (355646553).
The spelling of 215620041 in words is "two hundred fifteen million, six hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •