Base | Representation |
---|---|
bin | 10101100011100001… |
… | …101110001110010111 |
3 | 2012201222200120020101 |
4 | 111203201232032113 |
5 | 334400010332301 |
6 | 14344341314531 |
7 | 1446355014004 |
oct | 254341561627 |
9 | 65658616211 |
10 | 23144620951 |
11 | 98a7598311 |
12 | 459b105a47 |
13 | 224b0268aa |
14 | 1197bb68ab |
15 | 906d7a701 |
hex | 56386e397 |
23144620951 has 2 divisors, whose sum is σ = 23144620952. Its totient is φ = 23144620950.
The previous prime is 23144620937. The next prime is 23144620999. The reversal of 23144620951 is 15902644132.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23144620951 - 213 = 23144612759 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23144620951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23144623951) 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, 11572310475 + 11572310476.
It is an arithmetic number, because the mean of its divisors is an integer number (11572310476).
Almost surely, 223144620951 is an apocalyptic number.
23144620951 is a deficient number, since it is larger than the sum of its proper divisors (1).
23144620951 is an equidigital number, since it uses as much as digits as its factorization.
23144620951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 23144620951 in words is "twenty-three billion, one hundred forty-four million, six hundred twenty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •