Base | Representation |
---|---|
bin | 11110010100001110010111… |
… | …011111001110000010010100 |
3 | 122111002100011100210120210201 |
4 | 132110032113133032002110 |
5 | 114433444310044011200 |
6 | 1151323302441230244 |
7 | 40040601465524560 |
oct | 3624162737160224 |
9 | 574070140716721 |
10 | 133331211313300 |
11 | 395354a3937900 |
12 | 12b54594a92384 |
13 | 59521052317c0 |
14 | 24cd39d4786a0 |
15 | 10633b65e7c6a |
hex | 7943977ce094 |
133331211313300 has 216 divisors, whose sum is σ = 391412294620928. Its totient is φ = 38361027513600.
The previous prime is 133331211313253. The next prime is 133331211313303. The reversal of 133331211313300 is 3313112133331.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133331211313303) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 59443452 + ... + 61645651.
Almost surely, 2133331211313300 is an apocalyptic number.
133331211313300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133331211313300 is an abundant number, since it is smaller than the sum of its proper divisors (258081083307628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133331211313300 is a wasteful number, since it uses less digits than its factorization.
133331211313300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121089159 (or 121089141 counting only the distinct ones).
The product of its (nonzero) digits is 4374, while the sum is 28.
Adding to 133331211313300 its reverse (3313112133331), we get a palindrome (136644323446631).
The spelling of 133331211313300 in words is "one hundred thirty-three trillion, three hundred thirty-one billion, two hundred eleven million, three hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •