Base | Representation |
---|---|
bin | 1010011110010100… |
… | …11000110110101001 |
3 | 112111212211121011212 |
4 | 11033022120312221 |
5 | 43004002344401 |
6 | 2325550202505 |
7 | 256226324102 |
oct | 51712306651 |
9 | 15455747155 |
10 | 5623090601 |
11 | 24260a7217 |
12 | 110b1b3435 |
13 | 6b7c8055b |
14 | 3b4b393a9 |
15 | 22d9d5dbb |
hex | 14f298da9 |
5623090601 has 2 divisors, whose sum is σ = 5623090602. Its totient is φ = 5623090600.
The previous prime is 5623090573. The next prime is 5623090621. The reversal of 5623090601 is 1060903265.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3933798400 + 1689292201 = 62720^2 + 41101^2 .
It is a cyclic number.
It is not a de Polignac number, because 5623090601 - 26 = 5623090537 is a prime.
It is a super-3 number, since 3×56230906013 (a number of 30 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5623090621) 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 as a sum of consecutive naturals, namely, 2811545300 + 2811545301.
It is an arithmetic number, because the mean of its divisors is an integer number (2811545301).
Almost surely, 25623090601 is an apocalyptic number.
It is an amenable number.
5623090601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5623090601 is an equidigital number, since it uses as much as digits as its factorization.
5623090601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 5623090601 is about 74987.2695929116. The cubic root of 5623090601 is about 1778.2453989970.
Adding to 5623090601 its reverse (1060903265), we get a palindrome (6683993866).
The spelling of 5623090601 in words is "five billion, six hundred twenty-three million, ninety thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •