Base | Representation |
---|---|
bin | 11101110011111100011… |
… | …11001010100100101011 |
3 | 10121220221122000120211010 |
4 | 32321332033022210223 |
5 | 113240301422334011 |
6 | 2102322143035003 |
7 | 134001415241166 |
oct | 16717617124453 |
9 | 3556848016733 |
10 | 1024320121131 |
11 | 36545900595a |
12 | 14662a89ba63 |
13 | 757929b9268 |
14 | 378123b2add |
15 | 1b9a18dd1a6 |
hex | ee7e3ca92b |
1024320121131 has 8 divisors (see below), whose sum is σ = 1369271114640. Its totient is φ = 681124604192.
The previous prime is 1024320121127. The next prime is 1024320121133. The reversal of 1024320121131 is 1311210234201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1024320121131 - 22 = 1024320121127 is a prime.
It is a super-2 number, since 2×10243201211312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1024320121098 and 1024320121107.
It is not an unprimeable number, because it can be changed into a prime (1024320121133) 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, 438867780 + ... + 438870113.
It is an arithmetic number, because the mean of its divisors is an integer number (171158889330).
Almost surely, 21024320121131 is an apocalyptic number.
1024320121131 is a deficient number, since it is larger than the sum of its proper divisors (344950993509).
1024320121131 is an equidigital number, since it uses as much as digits as its factorization.
1024320121131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 877738285.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1024320121131 its reverse (1311210234201), we get a palindrome (2335530355332).
The spelling of 1024320121131 in words is "one trillion, twenty-four billion, three hundred twenty million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •