Base | Representation |
---|---|
bin | 1001011010101010… |
… | …01110010011000001 |
3 | 111001022211021221012 |
4 | 10231111032103001 |
5 | 40323202134401 |
6 | 2153353010305 |
7 | 236165042246 |
oct | 45525162301 |
9 | 14038737835 |
10 | 5055505601 |
11 | 2164779203 |
12 | b910b3995 |
13 | 6274c3c43 |
14 | 35d5cd5cd |
15 | 1e8c6c8bb |
hex | 12d54e4c1 |
5055505601 has 4 divisors (see below), whose sum is σ = 5138382804. Its totient is φ = 4972628400.
The previous prime is 5055505589. The next prime is 5055505613. The reversal of 5055505601 is 1065055505.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (5055505589) and next prime (5055505613).
It can be written as a sum of positive squares in 2 ways, for example, as 2613663376 + 2441842225 = 51124^2 + 49415^2 .
It is a cyclic number.
It is not a de Polignac number, because 5055505601 - 210 = 5055504577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5055502601) 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, 41438510 + ... + 41438631.
It is an arithmetic number, because the mean of its divisors is an integer number (1284595701).
Almost surely, 25055505601 is an apocalyptic number.
It is an amenable number.
5055505601 is a deficient number, since it is larger than the sum of its proper divisors (82877203).
5055505601 is an equidigital number, since it uses as much as digits as its factorization.
5055505601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82877202.
The product of its (nonzero) digits is 18750, while the sum is 32.
The square root of 5055505601 is about 71102.0787389511. The cubic root of 5055505601 is about 1716.2802252312.
The spelling of 5055505601 in words is "five billion, fifty-five million, five hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •