Base | Representation |
---|---|
bin | 1111101101111000111… |
… | …00001111110001010001 |
3 | 1220121220210022000202212 |
4 | 13312330130033301101 |
5 | 32321441300330413 |
6 | 1052030521121505 |
7 | 54005335641566 |
oct | 7667434176121 |
9 | 1817823260685 |
10 | 540032433233 |
11 | 199032259067 |
12 | 887b3929295 |
13 | 3bc03b479a7 |
14 | 1c1cdc3486d |
15 | e0aa3c4ca8 |
hex | 7dbc70fc51 |
540032433233 has 2 divisors, whose sum is σ = 540032433234. Its totient is φ = 540032433232.
The previous prime is 540032433221. The next prime is 540032433277. The reversal of 540032433233 is 332334230045.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 530110679569 + 9921753664 = 728087^2 + 99608^2 .
It is a cyclic number.
It is not a de Polignac number, because 540032433233 - 232 = 535737465937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 540032433233.
It is not a weakly prime, because it can be changed into another prime (540032433203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270016216616 + 270016216617.
It is an arithmetic number, because the mean of its divisors is an integer number (270016216617).
Almost surely, 2540032433233 is an apocalyptic number.
It is an amenable number.
540032433233 is a deficient number, since it is larger than the sum of its proper divisors (1).
540032433233 is an equidigital number, since it uses as much as digits as its factorization.
540032433233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 32.
Adding to 540032433233 its reverse (332334230045), we get a palindrome (872366663278).
The spelling of 540032433233 in words is "five hundred forty billion, thirty-two million, four hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •