Base | Representation |
---|---|
bin | 1010100111000011110110… |
… | …11011101111010101011101 |
3 | 10001121112211102022122000120 |
4 | 11103201323123233111131 |
5 | 11024234104301034323 |
6 | 121342420443545153 |
7 | 4625463653034402 |
oct | 523417333572535 |
9 | 101545742278016 |
10 | 23332333221213 |
11 | 7486206915735 |
12 | 2749b6722b1b9 |
13 | 10032ca5119a3 |
14 | 5a941053a2a9 |
15 | 2a6dda6475e3 |
hex | 15387b6ef55d |
23332333221213 has 4 divisors (see below), whose sum is σ = 31109777628288. Its totient is φ = 15554888814140.
The previous prime is 23332333221149. The next prime is 23332333221217. The reversal of 23332333221213 is 31212233323332.
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 23332333221213 - 26 = 23332333221149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23332333221217) 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, 3888722203533 + ... + 3888722203538.
It is an arithmetic number, because the mean of its divisors is an integer number (7777444407072).
Almost surely, 223332333221213 is an apocalyptic number.
It is an amenable number.
23332333221213 is a deficient number, since it is larger than the sum of its proper divisors (7777444407075).
23332333221213 is an equidigital number, since it uses as much as digits as its factorization.
23332333221213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7777444407074.
The product of its digits is 69984, while the sum is 33.
Adding to 23332333221213 its reverse (31212233323332), we get a palindrome (54544566544545).
The spelling of 23332333221213 in words is "twenty-three trillion, three hundred thirty-two billion, three hundred thirty-three million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •