Base | Representation |
---|---|
bin | 1010100111000101001010… |
… | …00101110010101110100101 |
3 | 10001121121122010101220120222 |
4 | 11103202211011302232211 |
5 | 11024242022210023023 |
6 | 121343014051334125 |
7 | 4625520200353112 |
oct | 523424505625645 |
9 | 101547563356528 |
10 | 23333032111013 |
11 | 7486535376a09 |
12 | 274a1212b1345 |
13 | 10033ac252951 |
14 | 5a94792a5909 |
15 | 2a6e2bb9acc8 |
hex | 1538a5172ba5 |
23333032111013 has 4 divisors (see below), whose sum is σ = 23500895651520. Its totient is φ = 23165168570508.
The previous prime is 23333032111007. The next prime is 23333032111031. The reversal of 23333032111013 is 31011123033332.
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 a de Polignac number, because none of the positive numbers 2k-23333032111013 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 (23333032111003) 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, 83931770045 + ... + 83931770322.
It is an arithmetic number, because the mean of its divisors is an integer number (5875223912880).
Almost surely, 223333032111013 is an apocalyptic number.
It is an amenable number.
23333032111013 is a deficient number, since it is larger than the sum of its proper divisors (167863540507).
23333032111013 is a wasteful number, since it uses less digits than its factorization.
23333032111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167863540506.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 23333032111013 its reverse (31011123033332), we get a palindrome (54344155144345).
The spelling of 23333032111013 in words is "twenty-three trillion, three hundred thirty-three billion, thirty-two million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •