Base | Representation |
---|---|
bin | 1000000010010010… |
… | …00111010000110001 |
3 | 102010122210200200012 |
4 | 10001021013100301 |
5 | 32313404233203 |
6 | 1552030504305 |
7 | 211623346562 |
oct | 40111072061 |
9 | 12118720605 |
10 | 4314133553 |
11 | 1914241434 |
12 | a04965095 |
13 | 539a2a662 |
14 | 2ccd66169 |
15 | 1a3b26bd8 |
hex | 101247431 |
4314133553 has 2 divisors, whose sum is σ = 4314133554. Its totient is φ = 4314133552.
The previous prime is 4314133547. The next prime is 4314133573. The reversal of 4314133553 is 3553314134.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4131018529 + 183115024 = 64273^2 + 13532^2 .
It is a cyclic number.
It is not a de Polignac number, because 4314133553 - 26 = 4314133489 is a prime.
It is a super-2 number, since 2×43141335532 = 37223496626240807618, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4314133573) 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, 2157066776 + 2157066777.
It is an arithmetic number, because the mean of its divisors is an integer number (2157066777).
Almost surely, 24314133553 is an apocalyptic number.
It is an amenable number.
4314133553 is a deficient number, since it is larger than the sum of its proper divisors (1).
4314133553 is an equidigital number, since it uses as much as digits as its factorization.
4314133553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32400, while the sum is 32.
The square root of 4314133553 is about 65682.0641651890. The cubic root of 4314133553 is about 1627.9130143715.
Adding to 4314133553 its reverse (3553314134), we get a palindrome (7867447687).
The spelling of 4314133553 in words is "four billion, three hundred fourteen million, one hundred thirty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •