Base | Representation |
---|---|
bin | 11110001111110110000011… |
… | …101010011110101011010000 |
3 | 122110000120021112020222201222 |
4 | 132033312003222132223100 |
5 | 114414031403114310000 |
6 | 1150533124444544212 |
7 | 40010055065255132 |
oct | 3617660352365320 |
9 | 573016245228658 |
10 | 133030231010000 |
11 | 39429893350195 |
12 | 12b06197252068 |
13 | 592c90a2a108c |
14 | 24bc9aa075052 |
15 | 105a64cd48a85 |
hex | 78fd83a9ead0 |
133030231010000 has 50 divisors (see below), whose sum is σ = 322079492322522. Its totient is φ = 53212092400000.
The previous prime is 133030231009933. The next prime is 133030231010011. The reversal of 133030231010000 is 10132030331.
It can be written as a sum of positive squares in 5 ways, for example, as 12331531210384 + 120698699799616 = 3511628^2 + 10986296^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6651501551 + ... + 6651521550.
Almost surely, 2133030231010000 is an apocalyptic number.
133030231010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133030231010000 is an abundant number, since it is smaller than the sum of its proper divisors (189049261312522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133030231010000 is an equidigital number, since it uses as much as digits as its factorization.
133030231010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13303023129 (or 13303023108 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 133030231010000 its reverse (10132030331), we get a palindrome (133040363040331).
The spelling of 133030231010000 in words is "one hundred thirty-three trillion, thirty billion, two hundred thirty-one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •