Base | Representation |
---|---|
bin | 100100011111000101101… |
… | …0110000100110000011001 |
3 | 122202101110122002012210201 |
4 | 1020332023112010300121 |
5 | 1124124312022412410 |
6 | 14355354215342201 |
7 | 1025201405164426 |
oct | 110761326046031 |
9 | 18671418065721 |
10 | 5014564654105 |
11 | 1663735021786 |
12 | 68ba33681961 |
13 | 2a4b436746a6 |
14 | 1349c5c44d4d |
15 | 8a6911de83a |
hex | 48f8b584c19 |
5014564654105 has 8 divisors (see below), whose sum is σ = 6043754781000. Its totient is φ = 3994133592576.
The previous prime is 5014564654039. The next prime is 5014564654109.
5014564654105 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 899553608704 + 4115011045401 = 948448^2 + 2028549^2 .
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 5014564654105 - 27 = 5014564653977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5014564654109) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2189765080 + ... + 2189767369.
It is an arithmetic number, because the mean of its divisors is an integer number (755469347625).
Almost surely, 25014564654105 is an apocalyptic number.
It is an amenable number.
5014564654105 is a deficient number, since it is larger than the sum of its proper divisors (1029190126895).
5014564654105 is a wasteful number, since it uses less digits than its factorization.
5014564654105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4379532683.
The product of its (nonzero) digits is 1440000, while the sum is 46.
The spelling of 5014564654105 in words is "five trillion, fourteen billion, five hundred sixty-four million, six hundred fifty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •