Base | Representation |
---|---|
bin | 1000000001001001… |
… | …1000101101011011 |
3 | 12112222221100021122 |
4 | 2000102120231123 |
5 | 13401442202301 |
6 | 553323155455 |
7 | 104223164114 |
oct | 20022305533 |
9 | 5488840248 |
10 | 2152303451 |
11 | a04a12491 |
12 | 500975b8b |
13 | 283ba184c |
14 | 165bc320b |
15 | c8e4981b |
hex | 80498b5b |
2152303451 has 8 divisors (see below), whose sum is σ = 2275567680. Its totient is φ = 2030037768.
The previous prime is 2152303379. The next prime is 2152303459. The reversal of 2152303451 is 1543032512.
It is a happy number.
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 2152303451 - 222 = 2148109147 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2152303451.
It is not an unprimeable number, because it can be changed into a prime (2152303459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 245201 + ... + 253826.
It is an arithmetic number, because the mean of its divisors is an integer number (284445960).
Almost surely, 22152303451 is an apocalyptic number.
2152303451 is a deficient number, since it is larger than the sum of its proper divisors (123264229).
2152303451 is a wasteful number, since it uses less digits than its factorization.
2152303451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499273.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 2152303451 is about 46392.9245790778. The cubic root of 2152303451 is about 1291.1236430945.
Adding to 2152303451 its reverse (1543032512), we get a palindrome (3695335963).
The spelling of 2152303451 in words is "two billion, one hundred fifty-two million, three hundred three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •