Base | Representation |
---|---|
bin | 1010011110101011… |
… | …01100100110000101 |
3 | 112112002102012122002 |
4 | 11033111230212011 |
5 | 43010232230140 |
6 | 2330133515045 |
7 | 256263451562 |
oct | 51725544605 |
9 | 15462365562 |
10 | 5626055045 |
11 | 2427841476 |
12 | 11101a2a85 |
13 | 6b877a970 |
14 | 3b52ab869 |
15 | 22ddbe415 |
hex | 14f56c985 |
5626055045 has 16 divisors (see below), whose sum is σ = 7273186032. Its totient is φ = 4153144320.
The previous prime is 5626055033. The next prime is 5626055051. The reversal of 5626055045 is 5405506265.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 2913624484 + 2712430561 = 53978^2 + 52081^2 .
It is not a de Polignac number, because 5626055045 - 214 = 5626038661 is a prime.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 188999 + ... + 216731.
It is an arithmetic number, because the mean of its divisors is an integer number (454574127).
Almost surely, 25626055045 is an apocalyptic number.
It is an amenable number.
5626055045 is a deficient number, since it is larger than the sum of its proper divisors (1647130987).
5626055045 is a wasteful number, since it uses less digits than its factorization.
5626055045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30872.
The product of its (nonzero) digits is 180000, while the sum is 38.
The square root of 5626055045 is about 75007.0333035509. The cubic root of 5626055045 is about 1778.5578358865.
The spelling of 5626055045 in words is "five billion, six hundred twenty-six million, fifty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •