Base | Representation |
---|---|
bin | 1010011110100111110101… |
… | …01111001010001101111111 |
3 | 10000120211111020222010022012 |
4 | 11033103322233022031333 |
5 | 11010011324234223432 |
6 | 121001312041441435 |
7 | 4565521300625636 |
oct | 517237257121577 |
9 | 100524436863265 |
10 | 23042411242367 |
11 | 7384260482940 |
12 | 2701934aa027b |
13 | cb1b755ba00a |
14 | 599389a6a51d |
15 | 29e5bcb08cb2 |
hex | 14f4fabca37f |
23042411242367 has 16 divisors (see below), whose sum is σ = 25321122601632. Its totient is φ = 20794363269120.
The previous prime is 23042411242339. The next prime is 23042411242391. The reversal of 23042411242367 is 76324211424032.
It is a cyclic number.
It is not a de Polignac number, because 23042411242367 - 214 = 23042411225983 is a prime.
It is a super-2 number, since 2×230424112423672 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23042411242337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111953183 + ... + 112158815.
It is an arithmetic number, because the mean of its divisors is an integer number (1582570162602).
Almost surely, 223042411242367 is an apocalyptic number.
23042411242367 is a deficient number, since it is larger than the sum of its proper divisors (2278711359265).
23042411242367 is a wasteful number, since it uses less digits than its factorization.
23042411242367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280138.
The product of its (nonzero) digits is 387072, while the sum is 41.
Adding to 23042411242367 its reverse (76324211424032), we get a palindrome (99366622666399).
The spelling of 23042411242367 in words is "twenty-three trillion, forty-two billion, four hundred eleven million, two hundred forty-two thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •