Base | Representation |
---|---|
bin | 1001100000001111… |
… | …00110010010100011 |
3 | 111011120210221110120 |
4 | 10300013212102203 |
5 | 40422134444012 |
6 | 2202143131323 |
7 | 240303353433 |
oct | 46007462243 |
9 | 14146727416 |
10 | 5102265507 |
11 | 2189106659 |
12 | ba48a3b43 |
13 | 6340b6621 |
14 | 3658c22c3 |
15 | 1ece0758c |
hex | 1301e64a3 |
5102265507 has 8 divisors (see below), whose sum is σ = 6816547584. Its totient is φ = 3394746888.
The previous prime is 5102265473. The next prime is 5102265521. The reversal of 5102265507 is 7055622015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5102265507 - 220 = 5101216931 is a prime.
It is a super-2 number, since 2×51022655072 = 52066226607843934098, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (5102265547) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1689103 + ... + 1692120.
It is an arithmetic number, because the mean of its divisors is an integer number (852068448).
Almost surely, 25102265507 is an apocalyptic number.
5102265507 is a deficient number, since it is larger than the sum of its proper divisors (1714282077).
5102265507 is a wasteful number, since it uses less digits than its factorization.
5102265507 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3381729.
The product of its (nonzero) digits is 21000, while the sum is 33.
The square root of 5102265507 is about 71430.1442459694. The cubic root of 5102265507 is about 1721.5554600284. Note that the first 3 decimals are identical.
The spelling of 5102265507 in words is "five billion, one hundred two million, two hundred sixty-five thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •