Base | Representation |
---|---|
bin | 1010011110101010… |
… | …10011100111010011 |
3 | 112112002020000021101 |
4 | 11033111103213103 |
5 | 43010220441343 |
6 | 2330131405231 |
7 | 256262544346 |
oct | 51725234723 |
9 | 15462200241 |
10 | 5625952723 |
11 | 2427781606 |
12 | 1110153817 |
13 | 6b8743211 |
14 | 3b528245d |
15 | 22dd9de4d |
hex | 14f5539d3 |
5625952723 has 2 divisors, whose sum is σ = 5625952724. Its totient is φ = 5625952722.
The previous prime is 5625952721. The next prime is 5625952769. The reversal of 5625952723 is 3272595265.
It is a happy number.
It is an a-pointer prime, because the next prime (5625952769) can be obtained adding 5625952723 to its sum of digits (46).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5625952723 - 21 = 5625952721 is a prime.
It is a super-2 number, since 2×56259527232 = 63302688082862229458, which contains 22 as substring.
Together with 5625952721, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5625952721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2812976361 + 2812976362.
It is an arithmetic number, because the mean of its divisors is an integer number (2812976362).
Almost surely, 25625952723 is an apocalyptic number.
5625952723 is a deficient number, since it is larger than the sum of its proper divisors (1).
5625952723 is an equidigital number, since it uses as much as digits as its factorization.
5625952723 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1134000, while the sum is 46.
The square root of 5625952723 is about 75006.3512177469. The cubic root of 5625952723 is about 1778.5470535119.
The spelling of 5625952723 in words is "five billion, six hundred twenty-five million, nine hundred fifty-two thousand, seven hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •