Base | Representation |
---|---|
bin | 1001011000010001… |
… | …00010010011000001 |
3 | 110222220222221120102 |
4 | 10230020202103001 |
5 | 40303030334213 |
6 | 2151354052145 |
7 | 235532133365 |
oct | 45410422301 |
9 | 13886887512 |
10 | 5035402433 |
11 | 2154398416 |
12 | b8641a055 |
13 | 6232a5889 |
14 | 35aa792a5 |
15 | 1e70eb158 |
hex | 12c2224c1 |
5035402433 has 2 divisors, whose sum is σ = 5035402434. Its totient is φ = 5035402432.
The previous prime is 5035402399. The next prime is 5035402451. The reversal of 5035402433 is 3342045305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3981231409 + 1054171024 = 63097^2 + 32468^2 .
It is a cyclic number.
It is not a de Polignac number, because 5035402433 - 210 = 5035401409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5035402396 and 5035402405.
It is not a weakly prime, because it can be changed into another prime (5035404433) 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, 2517701216 + 2517701217.
It is an arithmetic number, because the mean of its divisors is an integer number (2517701217).
Almost surely, 25035402433 is an apocalyptic number.
It is an amenable number.
5035402433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5035402433 is an equidigital number, since it uses as much as digits as its factorization.
5035402433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 29.
The square root of 5035402433 is about 70960.5695650761. The cubic root of 5035402433 is about 1714.0022793701.
Adding to 5035402433 its reverse (3342045305), we get a palindrome (8377447738).
The spelling of 5035402433 in words is "five billion, thirty-five million, four hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •