Base | Representation |
---|---|
bin | 11101110001110111001… |
… | …10110010011010000011 |
3 | 10121211001201112100101010 |
4 | 32320323212302122003 |
5 | 113231004233141011 |
6 | 2102015211012003 |
7 | 133631622353001 |
oct | 16707346623203 |
9 | 3554051470333 |
10 | 1023202240131 |
11 | 364a34a98365 |
12 | 14637843a003 |
13 | 75645217806 |
14 | 37747b3ba71 |
15 | 1b9386c41a6 |
hex | ee3b9b2683 |
1023202240131 has 8 divisors (see below), whose sum is σ = 1369194815824. Its totient is φ = 679672245600.
The previous prime is 1023202240111. The next prime is 1023202240133. The reversal of 1023202240131 is 1310422023201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023202240131 - 210 = 1023202239107 is a prime.
It is a super-2 number, since 2×10232022401312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1023202240098 and 1023202240107.
It is not an unprimeable number, because it can be changed into a prime (1023202240133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 615644320 + ... + 615645981.
It is an arithmetic number, because the mean of its divisors is an integer number (171149351978).
Almost surely, 21023202240131 is an apocalyptic number.
1023202240131 is a deficient number, since it is larger than the sum of its proper divisors (345992575693).
1023202240131 is a wasteful number, since it uses less digits than its factorization.
1023202240131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1231290581.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1023202240131 its reverse (1310422023201), we get a palindrome (2333624263332).
The spelling of 1023202240131 in words is "one trillion, twenty-three billion, two hundred two million, two hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •