Base | Representation |
---|---|
bin | 10011010111100111100… |
… | …100100000010111101101 |
3 | 11201020121202202211112101 |
4 | 103113213210200113231 |
5 | 133301422140014013 |
6 | 2455244452135101 |
7 | 165110110223110 |
oct | 23274744402755 |
9 | 4636552684471 |
10 | 1331030001133 |
11 | 473539810328 |
12 | 195b67307491 |
13 | 986919a2061 |
14 | 485ca710577 |
15 | 249531a98dd |
hex | 135e79205ed |
1331030001133 has 32 divisors (see below), whose sum is σ = 1566266895360. Its totient is φ = 1107563708160.
The previous prime is 1331030001131. The next prime is 1331030001179. The reversal of 1331030001133 is 3311000301331.
It is a happy number.
It is not a de Polignac number, because 1331030001133 - 21 = 1331030001131 is a prime.
It is a super-2 number, since 2×13310300011332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1331030001133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331030001131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 119982735 + ... + 119993827.
It is an arithmetic number, because the mean of its divisors is an integer number (48945840480).
Almost surely, 21331030001133 is an apocalyptic number.
It is an amenable number.
1331030001133 is a deficient number, since it is larger than the sum of its proper divisors (235236894227).
1331030001133 is a wasteful number, since it uses less digits than its factorization.
1331030001133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14797.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 1331030001133 its reverse (3311000301331), we get a palindrome (4642030302464).
The spelling of 1331030001133 in words is "one trillion, three hundred thirty-one billion, thirty million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •