Base | Representation |
---|---|
bin | 11010111101011… |
… | …010000101001111 |
3 | 1011112002111010121 |
4 | 122331122011033 |
5 | 1411242231411 |
6 | 112514245411 |
7 | 14131350100 |
oct | 3275320517 |
9 | 1145074117 |
10 | 452305231 |
11 | 212350684 |
12 | 107586867 |
13 | 72926041 |
14 | 440dc3a7 |
15 | 29a96571 |
hex | 1af5a14f |
452305231 has 12 divisors (see below), whose sum is σ = 526916208. Its totient is φ = 387126432.
The previous prime is 452305223. The next prime is 452305289. The reversal of 452305231 is 132503254.
It is not a de Polignac number, because 452305231 - 23 = 452305223 is a prime.
It is a super-2 number, since 2×4523052312 = 409160043979926722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 452305196 and 452305205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (452305291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29275 + ... + 41971.
It is an arithmetic number, because the mean of its divisors is an integer number (43909684).
Almost surely, 2452305231 is an apocalyptic number.
452305231 is a deficient number, since it is larger than the sum of its proper divisors (74610977).
452305231 is a wasteful number, since it uses less digits than its factorization.
452305231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13438 (or 13431 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 452305231 is about 21267.4688432827. The cubic root of 452305231 is about 767.6157378326.
Adding to 452305231 its reverse (132503254), we get a palindrome (584808485).
The spelling of 452305231 in words is "four hundred fifty-two million, three hundred five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •