Base | Representation |
---|---|
bin | 1001100000100100… |
… | …00100011100110101 |
3 | 111011202222101212102 |
4 | 10300102010130311 |
5 | 40423340313420 |
6 | 2202322031445 |
7 | 240335605331 |
oct | 46022043465 |
9 | 14152871772 |
10 | 5105010485 |
11 | 218a710a33 |
12 | ba57a8585 |
13 | 634837b83 |
14 | 365dd87c1 |
15 | 1ed29aa75 |
hex | 130484735 |
5105010485 has 8 divisors (see below), whose sum is σ = 6127124640. Its totient is φ = 4083267024.
The previous prime is 5105010479. The next prime is 5105010487. The reversal of 5105010485 is 5840105015.
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 5105010485 - 214 = 5104994101 is a prime.
It is a super-2 number, since 2×51050104852 = 52122264103919870450, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105010487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61415 + ... + 118244.
It is an arithmetic number, because the mean of its divisors is an integer number (765890580).
Almost surely, 25105010485 is an apocalyptic number.
It is an amenable number.
5105010485 is a deficient number, since it is larger than the sum of its proper divisors (1022114155).
5105010485 is a wasteful number, since it uses less digits than its factorization.
5105010485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185347.
The product of its (nonzero) digits is 4000, while the sum is 29.
The square root of 5105010485 is about 71449.3560852720. The cubic root of 5105010485 is about 1721.8641323662.
The spelling of 5105010485 in words is "five billion, one hundred five million, ten thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •