Base | Representation |
---|---|
bin | 10000000110000111100… |
… | …10000110110111001001 |
3 | 1221212111100021121102022 |
4 | 20003003302012313021 |
5 | 33030111332200223 |
6 | 1102021401214225 |
7 | 54645600512111 |
oct | 10030362066711 |
9 | 1855440247368 |
10 | 553040506313 |
11 | 1a35a7a47989 |
12 | 8b224191375 |
13 | 401c7ab5159 |
14 | 1caa56a2041 |
15 | e5bc3bdac8 |
hex | 80c3c86dc9 |
553040506313 has 4 divisors (see below), whose sum is σ = 585572300820. Its totient is φ = 520508711808.
The previous prime is 553040506247. The next prime is 553040506327. The reversal of 553040506313 is 313605040355.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 227036049289 + 326004457024 = 476483^2 + 570968^2 .
It is a cyclic number.
It is not a de Polignac number, because 553040506313 - 210 = 553040505289 is a prime.
It is not an unprimeable number, because it can be changed into a prime (553040506363) 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 in 3 ways as a sum of consecutive naturals, for example, 16265897228 + ... + 16265897261.
It is an arithmetic number, because the mean of its divisors is an integer number (146393075205).
Almost surely, 2553040506313 is an apocalyptic number.
It is an amenable number.
553040506313 is a deficient number, since it is larger than the sum of its proper divisors (32531794507).
553040506313 is a wasteful number, since it uses less digits than its factorization.
553040506313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32531794506.
The product of its (nonzero) digits is 81000, while the sum is 35.
Adding to 553040506313 its reverse (313605040355), we get a palindrome (866645546668).
The spelling of 553040506313 in words is "five hundred fifty-three billion, forty million, five hundred six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.579 sec. • engine limits •