Base | Representation |
---|---|
bin | 111100100100010… |
… | …1000000100010001 |
3 | 12020122010202112101 |
4 | 1321020220010101 |
5 | 13130232220101 |
6 | 533355200401 |
7 | 101235205501 |
oct | 17110500421 |
9 | 5218122471 |
10 | 2032304401 |
11 | 953201416 |
12 | 488746101 |
13 | 2650781aa |
14 | 153ca7a01 |
15 | bd644401 |
hex | 79228111 |
2032304401 has 2 divisors, whose sum is σ = 2032304402. Its totient is φ = 2032304400.
The previous prime is 2032304387. The next prime is 2032304411. The reversal of 2032304401 is 1044032302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1778730625 + 253573776 = 42175^2 + 15924^2 .
It is a cyclic number.
It is not a de Polignac number, because 2032304401 - 27 = 2032304273 is a prime.
It is a super-2 number, since 2×20323044012 = 8260522356647937602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2032304411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1016152200 + 1016152201.
It is an arithmetic number, because the mean of its divisors is an integer number (1016152201).
Almost surely, 22032304401 is an apocalyptic number.
It is an amenable number.
2032304401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2032304401 is an equidigital number, since it uses as much as digits as its factorization.
2032304401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2032304401 is about 45081.0869545090. The cubic root of 2032304401 is about 1266.6683504671.
Adding to 2032304401 its reverse (1044032302), we get a palindrome (3076336703).
The spelling of 2032304401 in words is "two billion, thirty-two million, three hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •