Base | Representation |
---|---|
bin | 11011101110001… |
… | …11001111110101 |
3 | 121012120211120022 |
4 | 31313013033311 |
5 | 434013121123 |
6 | 35024214525 |
7 | 5522440313 |
oct | 1567071765 |
9 | 535524508 |
10 | 232551413 |
11 | 10a2a6356 |
12 | 65a6a445 |
13 | 392436b3 |
14 | 22c570b3 |
15 | 156391c8 |
hex | ddc73f5 |
232551413 has 4 divisors (see below), whose sum is σ = 242662368. Its totient is φ = 222440460.
The previous prime is 232551409. The next prime is 232551421. The reversal of 232551413 is 314155232.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 232551413 - 22 = 232551409 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232551433) 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, 5055443 + ... + 5055488.
It is an arithmetic number, because the mean of its divisors is an integer number (60665592).
Almost surely, 2232551413 is an apocalyptic number.
232551413 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
232551413 is a deficient number, since it is larger than the sum of its proper divisors (10110955).
232551413 is a wasteful number, since it uses less digits than its factorization.
232551413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10110954.
The product of its digits is 3600, while the sum is 26.
The square root of 232551413 is about 15249.6364874708. The cubic root of 232551413 is about 614.9497947427.
The spelling of 232551413 in words is "two hundred thirty-two million, five hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •