Base | Representation |
---|---|
bin | 101000000011100000111… |
… | …1001000010011011001001 |
3 | 201111021122022021121120010 |
4 | 1100013001321002123021 |
5 | 1210143424122423001 |
6 | 15413002200222133 |
7 | 1105505442303651 |
oct | 120070171023311 |
9 | 21437568247503 |
10 | 5505106061001 |
11 | 183277a943188 |
12 | 74ab14a6a949 |
13 | 30c18b0270c1 |
14 | 15063cb99361 |
15 | 9830175b8d6 |
hex | 501c1e426c9 |
5505106061001 has 4 divisors (see below), whose sum is σ = 7340141414672. Its totient is φ = 3670070707332.
The previous prime is 5505106060943. The next prime is 5505106061003. The reversal of 5505106061001 is 1001606015055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5505106061001 - 210 = 5505106059977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5505106061001.
It is not an unprimeable number, because it can be changed into a prime (5505106061003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 917517676831 + ... + 917517676836.
It is an arithmetic number, because the mean of its divisors is an integer number (1835035353668).
Almost surely, 25505106061001 is an apocalyptic number.
It is an amenable number.
5505106061001 is a deficient number, since it is larger than the sum of its proper divisors (1835035353671).
5505106061001 is a wasteful number, since it uses less digits than its factorization.
5505106061001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1835035353670.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 5505106061001 in words is "five trillion, five hundred five billion, one hundred six million, sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •