Base | Representation |
---|---|
bin | 1010011110000101111100… |
… | …11101001010111000010111 |
3 | 10000112002112110222111110111 |
4 | 11033002332131022320113 |
5 | 11004212100311234333 |
6 | 120545103004503451 |
7 | 4564305431053606 |
oct | 517027635127027 |
9 | 100462473874414 |
10 | 23024220024343 |
11 | 7377575a6655a |
12 | 26ba2b884ab87 |
13 | cb0236888795 |
14 | 598541aa5a3d |
15 | 29dda5a7d4cd |
hex | 14f0be74ae17 |
23024220024343 has 4 divisors (see below), whose sum is σ = 23024282398920. Its totient is φ = 23024157649768.
The previous prime is 23024220024317. The next prime is 23024220024353. The reversal of 23024220024343 is 34342002242032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23024220024343 is a prime.
It is a super-2 number, since 2×230242200243432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23024220024353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30630280 + ... + 31372957.
It is an arithmetic number, because the mean of its divisors is an integer number (5756070599730).
Almost surely, 223024220024343 is an apocalyptic number.
23024220024343 is a deficient number, since it is larger than the sum of its proper divisors (62374577).
23024220024343 is an equidigital number, since it uses as much as digits as its factorization.
23024220024343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62374576.
The product of its (nonzero) digits is 55296, while the sum is 31.
Adding to 23024220024343 its reverse (34342002242032), we get a palindrome (57366222266375).
The spelling of 23024220024343 in words is "twenty-three trillion, twenty-four billion, two hundred twenty million, twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •