Base | Representation |
---|---|
bin | 1010011110010110111011… |
… | …01001010000111100101101 |
3 | 10000112222001121001222010120 |
4 | 11033023131221100330231 |
5 | 11004334231301120323 |
6 | 120553211152155153 |
7 | 4565050320011535 |
oct | 517133551207455 |
9 | 100488047058116 |
10 | 23033333223213 |
11 | 7380422143775 |
12 | 2700020838ab9 |
13 | cb1059921151 |
14 | 598b681464c5 |
15 | 29e23ab6a5e3 |
hex | 14f2dda50f2d |
23033333223213 has 4 divisors (see below), whose sum is σ = 30711110964288. Its totient is φ = 15355555482140.
The previous prime is 23033333223101. The next prime is 23033333223217. The reversal of 23033333223213 is 31232233333032.
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 23033333223213 - 210 = 23033333222189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23033333223217) 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, 3838888870533 + ... + 3838888870538.
It is an arithmetic number, because the mean of its divisors is an integer number (7677777741072).
Almost surely, 223033333223213 is an apocalyptic number.
It is an amenable number.
23033333223213 is a deficient number, since it is larger than the sum of its proper divisors (7677777741075).
23033333223213 is an equidigital number, since it uses as much as digits as its factorization.
23033333223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7677777741074.
The product of its (nonzero) digits is 104976, while the sum is 33.
Adding to 23033333223213 its reverse (31232233333032), we get a palindrome (54265566556245).
The spelling of 23033333223213 in words is "twenty-three trillion, thirty-three billion, three hundred thirty-three million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •