Base | Representation |
---|---|
bin | 1000000000111011… |
… | …1100101110101101 |
3 | 12112221020120021212 |
4 | 2000032330232231 |
5 | 13401224334123 |
6 | 553252004205 |
7 | 104212422146 |
oct | 20016745655 |
9 | 5487216255 |
10 | 2151402413 |
11 | a04457526 |
12 | 500600665 |
13 | 2839476a4 |
14 | 165a2aacd |
15 | c8d1c878 |
hex | 803bcbad |
2151402413 has 8 divisors (see below), whose sum is σ = 2178187200. Its totient is φ = 2124638368.
The previous prime is 2151402401. The next prime is 2151402431. The reversal of 2151402413 is 3142041512.
2151402413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2151402413 - 24 = 2151402397 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2151402493) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 363008 + ... + 368886.
It is an arithmetic number, because the mean of its divisors is an integer number (272273400).
Almost surely, 22151402413 is an apocalyptic number.
It is an amenable number.
2151402413 is a deficient number, since it is larger than the sum of its proper divisors (26784787).
2151402413 is an equidigital number, since it uses as much as digits as its factorization.
2151402413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10371.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 2151402413 is about 46383.2126205161. The cubic root of 2151402413 is about 1290.9434464090.
Adding to 2151402413 its reverse (3142041512), we get a palindrome (5293443925).
The spelling of 2151402413 in words is "two billion, one hundred fifty-one million, four hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •