Base | Representation |
---|---|
bin | 10101011100111000… |
… | …110001111111111101 |
3 | 2012110020002002000022 |
4 | 111130320301333331 |
5 | 334133001201323 |
6 | 14325321541525 |
7 | 1443533120045 |
oct | 253470617775 |
9 | 65406062008 |
10 | 23033225213 |
11 | 984a723019 |
12 | 45699448a5 |
13 | 2230c2315b |
14 | 118709a725 |
15 | 8ec1c44c8 |
hex | 55ce31ffd |
23033225213 has 8 divisors (see below), whose sum is σ = 23121007416. Its totient is φ = 22945484800.
The previous prime is 23033225203. The next prime is 23033225219. The reversal of 23033225213 is 31252233032.
It can be written as a sum of positive squares in 4 ways, for example, as 931348324 + 22101876889 = 30518^2 + 148667^2 .
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 23033225213 - 24 = 23033225197 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 (23033225219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1504445 + ... + 1519677.
It is an arithmetic number, because the mean of its divisors is an integer number (2890125927).
Almost surely, 223033225213 is an apocalyptic number.
It is an amenable number.
23033225213 is a deficient number, since it is larger than the sum of its proper divisors (87782203).
23033225213 is a wasteful number, since it uses less digits than its factorization.
23033225213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20895.
The product of its (nonzero) digits is 6480, while the sum is 26.
Adding to 23033225213 its reverse (31252233032), we get a palindrome (54285458245).
The spelling of 23033225213 in words is "twenty-three billion, thirty-three million, two hundred twenty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •