Base | Representation |
---|---|
bin | 1010100011110111001001… |
… | …01101110111010011001101 |
3 | 10001020001011002211101121020 |
4 | 11101323210231313103031 |
5 | 11020434014142233123 |
6 | 121220123125424353 |
7 | 4614523321523604 |
oct | 521734455672315 |
9 | 101201132741536 |
10 | 23222430430413 |
11 | 7443639630305 |
12 | 27307b4b6b0b9 |
13 | cc5b341bc226 |
14 | 5a3d8621ca3b |
15 | 2a4106d527e3 |
hex | 151ee4b774cd |
23222430430413 has 4 divisors (see below), whose sum is σ = 30963240573888. Its totient is φ = 15481620286940.
The previous prime is 23222430430403. The next prime is 23222430430421. The reversal of 23222430430413 is 31403403422232.
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 23222430430413 - 26 = 23222430430349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23222430430403) 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, 3870405071733 + ... + 3870405071738.
It is an arithmetic number, because the mean of its divisors is an integer number (7740810143472).
Almost surely, 223222430430413 is an apocalyptic number.
It is an amenable number.
23222430430413 is a deficient number, since it is larger than the sum of its proper divisors (7740810143475).
23222430430413 is an equidigital number, since it uses as much as digits as its factorization.
23222430430413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7740810143474.
The product of its (nonzero) digits is 82944, while the sum is 33.
Adding to 23222430430413 its reverse (31403403422232), we get a palindrome (54625833852645).
The spelling of 23222430430413 in words is "twenty-three trillion, two hundred twenty-two billion, four hundred thirty million, four hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •