Base | Representation |
---|---|
bin | 101001101000100001001… |
… | …0000001000000000010111 |
3 | 202021000111120110210220212 |
4 | 1103101002100020000113 |
5 | 1222222133014232443 |
6 | 20100353144520035 |
7 | 1130254456114112 |
oct | 123210220100027 |
9 | 22230446423825 |
10 | 5722007961623 |
11 | 190676535a498 |
12 | 784b68a8001b |
13 | 326776c0ccb5 |
14 | 15ad37901579 |
15 | 9dc9897b618 |
hex | 53442408017 |
5722007961623 has 2 divisors, whose sum is σ = 5722007961624. Its totient is φ = 5722007961622.
The previous prime is 5722007961589. The next prime is 5722007961629. The reversal of 5722007961623 is 3261697002275.
5722007961623 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5722007961623 - 214 = 5722007945239 is a prime.
It is a super-2 number, since 2×57220079616232 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5722007961629) 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 as a sum of consecutive naturals, namely, 2861003980811 + 2861003980812.
It is an arithmetic number, because the mean of its divisors is an integer number (2861003980812).
Almost surely, 25722007961623 is an apocalyptic number.
5722007961623 is a deficient number, since it is larger than the sum of its proper divisors (1).
5722007961623 is an equidigital number, since it uses as much as digits as its factorization.
5722007961623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1905120, while the sum is 50.
The spelling of 5722007961623 in words is "five trillion, seven hundred twenty-two billion, seven million, nine hundred sixty-one thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •