Base | Representation |
---|---|
bin | 10011010111100110111… |
… | …111001000000000101101 |
3 | 11201020121002022222200121 |
4 | 103113212333020000231 |
5 | 133301412132431104 |
6 | 2455243502124541 |
7 | 165106631021230 |
oct | 23274677100055 |
9 | 4636532288617 |
10 | 1331020202029 |
11 | 4735342280a1 |
12 | 195b63b80751 |
13 | 9868c950a7b |
14 | 485c92bd417 |
15 | 249523c1254 |
hex | 135e6fc802d |
1331020202029 has 8 divisors (see below), whose sum is σ = 1521512408448. Its totient is φ = 1140614611440.
The previous prime is 1331020202027. The next prime is 1331020202089. The reversal of 1331020202029 is 9202020201331.
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 1331020202029 - 21 = 1331020202027 is a prime.
It is a super-2 number, since 2×13310202020292 (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 = 1331020201994 and 1331020202012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331020202027) 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, 21621022 + ... + 21682495.
It is an arithmetic number, because the mean of its divisors is an integer number (190189051056).
Almost surely, 21331020202029 is an apocalyptic number.
It is an amenable number.
1331020202029 is a deficient number, since it is larger than the sum of its proper divisors (190492206419).
1331020202029 is an equidigital number, since it uses as much as digits as its factorization.
1331020202029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43307915.
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 1331020202029 in words is "one trillion, three hundred thirty-one billion, twenty million, two hundred two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •