Base | Representation |
---|---|
bin | 10011011001011110010… |
… | …000010100111010001010 |
3 | 11201102202112120012212221 |
4 | 103121132100110322022 |
5 | 133320011411400020 |
6 | 2500214222324254 |
7 | 165210336150463 |
oct | 23313620247212 |
9 | 4642675505787 |
10 | 1333021200010 |
11 | 474370796535 |
12 | 19642212968a |
13 | 9891b387446 |
14 | 48738d57d6a |
15 | 24a1cdce6aa |
hex | 1365e414e8a |
1333021200010 has 8 divisors (see below), whose sum is σ = 2399438160036. Its totient is φ = 533208480000.
The previous prime is 1333021199969. The next prime is 1333021200011. The reversal of 1333021200010 is 100021203331.
It can be written as a sum of positive squares in 2 ways, for example, as 1332092230569 + 928969441 = 1154163^2 + 30479^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×13330212000102 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1333021200011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66651059991 + ... + 66651060010.
Almost surely, 21333021200010 is an apocalyptic number.
1333021200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1333021200010 is a deficient number, since it is larger than the sum of its proper divisors (1066416960026).
1333021200010 is a wasteful number, since it uses less digits than its factorization.
1333021200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133302120008.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1333021200010 its reverse (100021203331), we get a palindrome (1433042403341).
The spelling of 1333021200010 in words is "one trillion, three hundred thirty-three billion, twenty-one million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •