Base | Representation |
---|---|
bin | 1010100011111000111110… |
… | …00111111000111001001101 |
3 | 10001020010200101200111210110 |
4 | 11101330133013320321031 |
5 | 11020443021021044323 |
6 | 121220404252230233 |
7 | 4614556520533341 |
oct | 521743707707115 |
9 | 101203611614713 |
10 | 23223410331213 |
11 | 7443aa1776284 |
12 | 2730a2916b379 |
13 | cc5c5c20caa1 |
14 | 5a403a417621 |
15 | 2a4162db3793 |
hex | 151f1f1f8e4d |
23223410331213 has 4 divisors (see below), whose sum is σ = 30964547108288. Its totient is φ = 15482273554140.
The previous prime is 23223410331193. The next prime is 23223410331221. The reversal of 23223410331213 is 31213301432232.
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 not a de Polignac number, because 23223410331213 - 25 = 23223410331181 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 (23223414331213) 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, 3870568388533 + ... + 3870568388538.
It is an arithmetic number, because the mean of its divisors is an integer number (7741136777072).
Almost surely, 223223410331213 is an apocalyptic number.
It is an amenable number.
23223410331213 is a deficient number, since it is larger than the sum of its proper divisors (7741136777075).
23223410331213 is an equidigital number, since it uses as much as digits as its factorization.
23223410331213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7741136777074.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 23223410331213 its reverse (31213301432232), we get a palindrome (54436711763445).
The spelling of 23223410331213 in words is "twenty-three trillion, two hundred twenty-three billion, four hundred ten million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •