Base | Representation |
---|---|
bin | 1001010101101011… |
… | …11100010100110111 |
3 | 110221102020221112000 |
4 | 10222311330110313 |
5 | 40232010013340 |
6 | 2145302030343 |
7 | 235150116063 |
oct | 45265742467 |
9 | 13842227460 |
10 | 5013751095 |
11 | 214314a451 |
12 | b7b1183b3 |
13 | 61b964932 |
14 | 357c40aa3 |
15 | 1e5270d30 |
hex | 12ad7c537 |
5013751095 has 32 divisors (see below), whose sum is σ = 9437653440. Its totient is φ = 2516705280.
The previous prime is 5013751087. The next prime is 5013751111. The reversal of 5013751095 is 5901573105.
5013751095 is a `hidden beast` number, since 5 + 0 + 137 + 510 + 9 + 5 = 666.
5013751095 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5013751095 - 23 = 5013751087 is a prime.
It is a super-2 number, since 2×50137510952 = 50275400085227398050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1090026 + ... + 1094615.
It is an arithmetic number, because the mean of its divisors is an integer number (294926670).
Almost surely, 25013751095 is an apocalyptic number.
5013751095 is a deficient number, since it is larger than the sum of its proper divisors (4423902345).
5013751095 is a wasteful number, since it uses less digits than its factorization.
5013751095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184672 (or 2184666 counting only the distinct ones).
The product of its (nonzero) digits is 23625, while the sum is 36.
The square root of 5013751095 is about 70807.8462813268. The cubic root of 5013751095 is about 1711.5421145641.
The spelling of 5013751095 in words is "five billion, thirteen million, seven hundred fifty-one thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •