Base | Representation |
---|---|
bin | 110100110110101000001010… |
… | …111110110110111111100011 |
3 | 1010111001020021201120111000001 |
4 | 310312220022332312333203 |
5 | 220432000010441310301 |
6 | 2142215054342440431 |
7 | 66651063163110646 |
oct | 6466501276667743 |
9 | 1114036251514001 |
10 | 232452404244451 |
11 | 680805691a1016 |
12 | 220a29bba33117 |
13 | 9c922244840a1 |
14 | 4158a83799a5d |
15 | 1bd19491e7c01 |
hex | d36a0afb6fe3 |
232452404244451 has 2 divisors, whose sum is σ = 232452404244452. Its totient is φ = 232452404244450.
The previous prime is 232452404244413. The next prime is 232452404244461. The reversal of 232452404244451 is 154442404254232.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 232452404244451 - 211 = 232452404242403 is a prime.
It is a super-2 number, since 2×2324524042444512 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (232452404244461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116226202122225 + 116226202122226.
It is an arithmetic number, because the mean of its divisors is an integer number (116226202122226).
Almost surely, 2232452404244451 is an apocalyptic number.
232452404244451 is a deficient number, since it is larger than the sum of its proper divisors (1).
232452404244451 is an equidigital number, since it uses as much as digits as its factorization.
232452404244451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4915200, while the sum is 46.
Adding to 232452404244451 its reverse (154442404254232), we get a palindrome (386894808498683).
The spelling of 232452404244451 in words is "two hundred thirty-two trillion, four hundred fifty-two billion, four hundred four million, two hundred forty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •