Base | Representation |
---|---|
bin | 1001101100111110… |
… | …11111101100111001 |
3 | 111110001000102210012 |
4 | 10312133133230321 |
5 | 41132023141043 |
6 | 2220523031305 |
7 | 243042261254 |
oct | 46637375471 |
9 | 14401012705 |
10 | 5209193273 |
11 | 22334aa009 |
12 | 101466b535 |
13 | 6502b44ab |
14 | 375b9809b |
15 | 2074c9a18 |
hex | 1367dfb39 |
5209193273 has 8 divisors (see below), whose sum is σ = 5485977120. Its totient is φ = 4932671040.
The previous prime is 5209193267. The next prime is 5209193291. The reversal of 5209193273 is 3723919025.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5209193273 - 24 = 5209193257 is a prime.
It is a super-3 number, since 3×52091932733 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5209193273.
It is not an unprimeable number, because it can be changed into a prime (5209193263) 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, 23840 + ... + 104817.
It is an arithmetic number, because the mean of its divisors is an integer number (685747140).
Almost surely, 25209193273 is an apocalyptic number.
It is an amenable number.
5209193273 is a deficient number, since it is larger than the sum of its proper divisors (276783847).
5209193273 is a wasteful number, since it uses less digits than its factorization.
5209193273 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130807.
The product of its (nonzero) digits is 102060, while the sum is 41.
The square root of 5209193273 is about 72174.7412395777. The cubic root of 5209193273 is about 1733.4985804447.
The spelling of 5209193273 in words is "five billion, two hundred nine million, one hundred ninety-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •