Base | Representation |
---|---|
bin | 100100110010001001111… |
… | …1000011001111111001001 |
3 | 122220022011012002101202102 |
4 | 1021210103320121333021 |
5 | 1130312141033423001 |
6 | 14430245205443145 |
7 | 1031151152331521 |
oct | 111442370317711 |
9 | 18808135071672 |
10 | 5055510061001 |
11 | 167a0366a5a34 |
12 | 6979601104b5 |
13 | 2a896a55b1ca |
14 | 13698bbcc681 |
15 | 8b78abc1e6b |
hex | 49913e19fc9 |
5055510061001 has 4 divisors (see below), whose sum is σ = 5056137848772. Its totient is φ = 5054882273232.
The previous prime is 5055510060989. The next prime is 5055510061037. The reversal of 5055510061001 is 1001600155505.
It is a happy number.
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 4223337365776 + 832172695225 = 2055076^2 + 912235^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5055510061001 is a prime.
It is a super-2 number, since 2×50555100610012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5055510061801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 313881806 + ... + 313897911.
It is an arithmetic number, because the mean of its divisors is an integer number (1264034462193).
Almost surely, 25055510061001 is an apocalyptic number.
It is an amenable number.
5055510061001 is a deficient number, since it is larger than the sum of its proper divisors (627787771).
5055510061001 is an equidigital number, since it uses as much as digits as its factorization.
5055510061001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 627787770.
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 5055510061001 in words is "five trillion, fifty-five billion, five hundred ten million, sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •