Base | Representation |
---|---|
bin | 1010100011110010110111… |
… | …01010010110100000001101 |
3 | 10001012211012212002210122222 |
4 | 11101321123222112200031 |
5 | 11020414312020443203 |
6 | 121215103025345125 |
7 | 4614412331123435 |
oct | 521713352264015 |
9 | 101184185083588 |
10 | 23220131031053 |
11 | 744266968a560 |
12 | 2730272a981a5 |
13 | cc58589c75a8 |
14 | 5a3c08aa92c5 |
15 | 2a402004e038 |
hex | 151e5ba9680d |
23220131031053 has 4 divisors (see below), whose sum is σ = 25331052033888. Its totient is φ = 21109210028220.
The previous prime is 23220131031037. The next prime is 23220131031061. The reversal of 23220131031053 is 35013013102232.
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 23220131031053 - 24 = 23220131031037 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 (23220131031353) 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, 1055460501401 + ... + 1055460501422.
It is an arithmetic number, because the mean of its divisors is an integer number (6332763008472).
Almost surely, 223220131031053 is an apocalyptic number.
It is an amenable number.
23220131031053 is a deficient number, since it is larger than the sum of its proper divisors (2110921002835).
23220131031053 is a wasteful number, since it uses less digits than its factorization.
23220131031053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2110921002834.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 23220131031053 its reverse (35013013102232), we get a palindrome (58233144133285).
The spelling of 23220131031053 in words is "twenty-three trillion, two hundred twenty billion, one hundred thirty-one million, thirty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •