Base | Representation |
---|---|
bin | 1001011100110010… |
… | …00110101101010110 |
3 | 111002120022100200111 |
4 | 10232121012231112 |
5 | 40342231102220 |
6 | 2155230233234 |
7 | 236502225001 |
oct | 45631065526 |
9 | 14076270614 |
10 | 5073300310 |
11 | 2173822681 |
12 | b9705581a |
13 | 62b0b4660 |
14 | 361b02538 |
15 | 1ea5d515a |
hex | 12e646b56 |
5073300310 has 64 divisors (see below), whose sum is σ = 10772092800. Its totient is φ = 1702213632.
The previous prime is 5073300307. The next prime is 5073300313. The reversal of 5073300310 is 130033705.
It is an interprime number because it is at equal distance from previous prime (5073300307) and next prime (5073300313).
It is a super-3 number, since 3×50733003103 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5073300313) 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 31 ways as a sum of consecutive naturals, for example, 24511 + ... + 103669.
It is an arithmetic number, because the mean of its divisors is an integer number (168313950).
Almost surely, 25073300310 is an apocalyptic number.
5073300310 is an abundant number, since it is smaller than the sum of its proper divisors (5698792490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5073300310 is a wasteful number, since it uses less digits than its factorization.
5073300310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79225.
The product of its (nonzero) digits is 945, while the sum is 22.
The square root of 5073300310 is about 71227.1037597346. The cubic root of 5073300310 is about 1718.2915600943.
The spelling of 5073300310 in words is "five billion, seventy-three million, three hundred thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •