Base | Representation |
---|---|
bin | 1000000011010110… |
… | …11011111101100001 |
3 | 102011021201211011121 |
4 | 10001223123331201 |
5 | 32323210144413 |
6 | 1552551412241 |
7 | 212063003101 |
oct | 40153337541 |
9 | 12137654147 |
10 | 4323131233 |
11 | 1919327533 |
12 | a07984081 |
13 | 53b85ac25 |
14 | 2d0229201 |
15 | 1a4802b8d |
hex | 101adbf61 |
4323131233 has 2 divisors, whose sum is σ = 4323131234. Its totient is φ = 4323131232.
The previous prime is 4323131213. The next prime is 4323131261. The reversal of 4323131233 is 3321313234.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4259259169 + 63872064 = 65263^2 + 7992^2 .
It is a cyclic number.
It is not a de Polignac number, because 4323131233 - 25 = 4323131201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4323131198 and 4323131207.
It is not a weakly prime, because it can be changed into another prime (4323131213) 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 as a sum of consecutive naturals, namely, 2161565616 + 2161565617.
It is an arithmetic number, because the mean of its divisors is an integer number (2161565617).
Almost surely, 24323131233 is an apocalyptic number.
It is an amenable number.
4323131233 is a deficient number, since it is larger than the sum of its proper divisors (1).
4323131233 is an equidigital number, since it uses as much as digits as its factorization.
4323131233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3888, while the sum is 25.
The square root of 4323131233 is about 65750.5226823331. The cubic root of 4323131233 is about 1629.0439690915.
Adding to 4323131233 its reverse (3321313234), we get a palindrome (7644444467).
The spelling of 4323131233 in words is "four billion, three hundred twenty-three million, one hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •