Base | Representation |
---|---|
bin | 100100000011001100111… |
… | …0100101110110011000001 |
3 | 122112122220000211110212101 |
4 | 1020012121310232303001 |
5 | 1122134140033421010 |
6 | 14312051521230401 |
7 | 1020651353240311 |
oct | 110063164566301 |
9 | 18478800743771 |
10 | 4954678029505 |
11 | 16402a36412a6 |
12 | 6802bb792401 |
13 | 29c2bb562049 |
14 | 131b44465441 |
15 | 88d388d473a |
hex | 48199d2ecc1 |
4954678029505 has 4 divisors (see below), whose sum is σ = 5945613635412. Its totient is φ = 3963742423600.
The previous prime is 4954678029503. The next prime is 4954678029527. The reversal of 4954678029505 is 5059208764594.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 497917930689 + 4456760098816 = 705633^2 + 2111104^2 .
It is not a de Polignac number, because 4954678029505 - 21 = 4954678029503 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4954678029503) 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 3 ways as a sum of consecutive naturals, for example, 495467802946 + ... + 495467802955.
It is an arithmetic number, because the mean of its divisors is an integer number (1486403408853).
Almost surely, 24954678029505 is an apocalyptic number.
It is an amenable number.
4954678029505 is a deficient number, since it is larger than the sum of its proper divisors (990935605907).
4954678029505 is an equidigital number, since it uses as much as digits as its factorization.
4954678029505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990935605906.
The product of its (nonzero) digits is 108864000, while the sum is 64.
The spelling of 4954678029505 in words is "four trillion, nine hundred fifty-four billion, six hundred seventy-eight million, twenty-nine thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •