Base | Representation |
---|---|
bin | 110000011101011011011… |
… | …001010010111000100000 |
3 | 102210100122200202220201201 |
4 | 300131123121102320200 |
5 | 414030103022341000 |
6 | 11025501511410544 |
7 | 462410541362404 |
oct | 60353331227040 |
9 | 12710580686651 |
10 | 3330133012000 |
11 | 10743352a5983 |
12 | 45949a983a54 |
13 | 1b2051455312 |
14 | b7271dc9104 |
15 | 5b95755296a |
hex | 3075b652e20 |
3330133012000 has 96 divisors (see below), whose sum is σ = 8213976454320. Its totient is φ = 1326869708800.
The previous prime is 3330133011991. The next prime is 3330133012007. The reversal of 3330133012000 is 2103310333.
It can be written as a sum of positive squares in 8 ways, for example, as 1502477771536 + 1827655240464 = 1225756^2 + 1351908^2 .
It is a super-2 number, since 2×33301330120002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3330133012007) 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 15 ways as a sum of consecutive naturals, for example, 591715 + ... + 2647714.
Almost surely, 23330133012000 is an apocalyptic number.
It is an amenable number.
3330133012000 is an abundant number, since it is smaller than the sum of its proper divisors (4883843442320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3330133012000 is a wasteful number, since it uses less digits than its factorization.
3330133012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3239711 (or 3239693 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 3330133012000 its reverse (2103310333), we get a palindrome (3332236322333).
The spelling of 3330133012000 in words is "three trillion, three hundred thirty billion, one hundred thirty-three million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •