Base | Representation |
---|---|
bin | 1010111010000000111010… |
… | …00000001111110000000001 |
3 | 10010220210211012112020000001 |
4 | 11131000131000033300001 |
5 | 11120421340000002031 |
6 | 123001523440000001 |
7 | 5023520366140651 |
oct | 535003500176001 |
9 | 103823735466001 |
10 | 23983583984641 |
11 | 77074209aa366 |
12 | 2834219900001 |
13 | 104c8470980c8 |
14 | 5ccb51296361 |
15 | 2b8d04a71861 |
hex | 15d01d00fc01 |
23983583984641 has 4 divisors (see below), whose sum is σ = 24091133688832. Its totient is φ = 23876034280452.
The previous prime is 23983583984579. The next prime is 23983583984653. The reversal of 23983583984641 is 14648938538932.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23983583984641 - 211 = 23983583982593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23983583984141) 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, 53774851761 + ... + 53774852206.
It is an arithmetic number, because the mean of its divisors is an integer number (6022783422208).
Almost surely, 223983583984641 is an apocalyptic number.
It is an amenable number.
23983583984641 is a deficient number, since it is larger than the sum of its proper divisors (107549704191).
23983583984641 is a wasteful number, since it uses less digits than its factorization.
23983583984641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107549704190.
The product of its digits is 1074954240, while the sum is 73.
The spelling of 23983583984641 in words is "twenty-three trillion, nine hundred eighty-three billion, five hundred eighty-three million, nine hundred eighty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •