Base | Representation |
---|---|
bin | 11110010100001101100001… |
… | …001111011111010010100000 |
3 | 122111002020210221022001111110 |
4 | 132110031201033133102200 |
5 | 114433440424103020000 |
6 | 1151323032250543320 |
7 | 40040540105050413 |
oct | 3624154117372240 |
9 | 574066727261443 |
10 | 133330301220000 |
11 | 39535077141285 |
12 | 12b54380137b40 |
13 | 5951cbb812c61 |
14 | 24cd314651b7a |
15 | 1063361775850 |
hex | 7943613df4a0 |
133330301220000 has 120 divisors (see below), whose sum is σ = 437350054258656. Its totient is φ = 35554746976000.
The previous prime is 133330301219903. The next prime is 133330301220023. The reversal of 133330301220000 is 22103033331.
It is a tau number, because it is divible by the number of its divisors (120).
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 1111025844 + ... + 1111145843.
Almost surely, 2133330301220000 is an apocalyptic number.
133330301220000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133330301220000 is an abundant number, since it is smaller than the sum of its proper divisors (304019753038656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133330301220000 is an equidigital number, since it uses as much as digits as its factorization.
133330301220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2222171720 (or 2222171697 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 133330301220000 its reverse (22103033331), we get a palindrome (133352404253331).
The spelling of 133330301220000 in words is "one hundred thirty-three trillion, three hundred thirty billion, three hundred one million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •