Base | Representation |
---|---|
bin | 1010100100001011001101… |
… | …01101001101110010001001 |
3 | 10001021001221201222212010210 |
4 | 11102011212231031302021 |
5 | 11021123044003424113 |
6 | 121225104005231333 |
7 | 4615354246035531 |
oct | 522054655156211 |
9 | 101231851885123 |
10 | 23233201233033 |
11 | 7448166453780 |
12 | 2732900102549 |
13 | cc6b5c7a8a0c |
14 | 5a46c88aa4c1 |
15 | 2a453771b6c3 |
hex | 152166b4dc89 |
23233201233033 has 8 divisors (see below), whose sum is σ = 33793747248096. Its totient is φ = 14080728020000.
The previous prime is 23233201233019. The next prime is 23233201233041. The reversal of 23233201233033 is 33033210233232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23233201233033 - 25 = 23233201233001 is a prime.
It is a super-2 number, since 2×232332012330332 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23233201033033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 352018200468 + ... + 352018200533.
It is an arithmetic number, because the mean of its divisors is an integer number (4224218406012).
Almost surely, 223233201233033 is an apocalyptic number.
It is an amenable number.
23233201233033 is a deficient number, since it is larger than the sum of its proper divisors (10560546015063).
23233201233033 is a wasteful number, since it uses less digits than its factorization.
23233201233033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704036401015.
The product of its (nonzero) digits is 34992, while the sum is 30.
Adding to 23233201233033 its reverse (33033210233232), we get a palindrome (56266411466265).
The spelling of 23233201233033 in words is "twenty-three trillion, two hundred thirty-three billion, two hundred one million, two hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •