Base | Representation |
---|---|
bin | 1010010111011010… |
… | …00001010010000001 |
3 | 112100211122100110200 |
4 | 11023231001102001 |
5 | 42344123411400 |
6 | 2320114315413 |
7 | 254623142244 |
oct | 51355012201 |
9 | 15324570420 |
10 | 5565060225 |
11 | 23a637112a |
12 | 10b3888b69 |
13 | 6a8c42c5a |
14 | 3ab15125b |
15 | 228871b00 |
hex | 14bb41481 |
5565060225 has 18 divisors (see below), whose sum is σ = 9967641606. Its totient is φ = 2968032000.
The previous prime is 5565060181. The next prime is 5565060227. The reversal of 5565060225 is 5220605655.
It can be written as a sum of positive squares in 3 ways, for example, as 138086001 + 5426974224 = 11751^2 + 73668^2 .
It is not a de Polignac number, because 5565060225 - 26 = 5565060161 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5565060225.
It is not an unprimeable number, because it can be changed into a prime (5565060227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 12366576 + ... + 12367025.
It is an arithmetic number, because the mean of its divisors is an integer number (553757867).
Almost surely, 25565060225 is an apocalyptic number.
It is an amenable number.
5565060225 is a deficient number, since it is larger than the sum of its proper divisors (4402581381).
5565060225 is a wasteful number, since it uses less digits than its factorization.
5565060225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24733617 (or 24733609 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The square root of 5565060225 is about 74599.3312637587. The cubic root of 5565060225 is about 1772.1070616990.
The spelling of 5565060225 in words is "five billion, five hundred sixty-five million, sixty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •