Base | Representation |
---|---|
bin | 11101110010000110101… |
… | …01110111001110001011 |
3 | 10121211101202201220102211 |
4 | 32321003111313032023 |
5 | 113231240444134011 |
6 | 2102040124405551 |
7 | 133635056442160 |
oct | 16710325671613 |
9 | 3554352656384 |
10 | 1023332021131 |
11 | 364aa127a792 |
12 | 1463b39a68b7 |
13 | 756660876c4 |
14 | 3775b082067 |
15 | 1b944cacb21 |
hex | ee4357738b |
1023332021131 has 8 divisors (see below), whose sum is σ = 1238317740000. Its totient is φ = 825545159808.
The previous prime is 1023332020987. The next prime is 1023332021161. The reversal of 1023332021131 is 1311202333201.
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 1023332021131 - 29 = 1023332020619 is a prime.
It is a super-2 number, since 2×10233320211312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1023332021161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4299714256 + ... + 4299714493.
It is an arithmetic number, because the mean of its divisors is an integer number (154789717500).
Almost surely, 21023332021131 is an apocalyptic number.
1023332021131 is a deficient number, since it is larger than the sum of its proper divisors (214985718869).
1023332021131 is an equidigital number, since it uses as much as digits as its factorization.
1023332021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8599428773.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1023332021131 its reverse (1311202333201), we get a palindrome (2334534354332).
The spelling of 1023332021131 in words is "one trillion, twenty-three billion, three hundred thirty-two million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •