Base | Representation |
---|---|
bin | 10101100011100010… |
… | …001110101100100101 |
3 | 2012201222221022200112 |
4 | 111203202032230211 |
5 | 334400024111312 |
6 | 14344344222405 |
7 | 1446356106533 |
oct | 254342165445 |
9 | 65658838615 |
10 | 23144753957 |
11 | 98a7679236 |
12 | 459b16aa05 |
13 | 224b0722b0 |
14 | 1197c0d153 |
15 | 906da4d22 |
hex | 56388eb25 |
23144753957 has 4 divisors (see below), whose sum is σ = 24925119660. Its totient is φ = 21364388256.
The previous prime is 23144753953. The next prime is 23144753969. The reversal of 23144753957 is 75935744132.
It is a Cunningham number, because it is equal to 1521342+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3423888196 + 19720865761 = 58514^2 + 140431^2 .
It is a cyclic number.
It is not a de Polignac number, because 23144753957 - 22 = 23144753953 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23144753953) 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 in 3 ways as a sum of consecutive naturals, for example, 890182832 + ... + 890182857.
It is an arithmetic number, because the mean of its divisors is an integer number (6231279915).
Almost surely, 223144753957 is an apocalyptic number.
It is an amenable number.
23144753957 is a deficient number, since it is larger than the sum of its proper divisors (1780365703).
23144753957 is a wasteful number, since it uses less digits than its factorization.
23144753957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1780365702.
The product of its digits is 3175200, while the sum is 50.
The spelling of 23144753957 in words is "twenty-three billion, one hundred forty-four million, seven hundred fifty-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •