Base | Representation |
---|---|
bin | 11110010011111011000000… |
… | …001111001100100101000000 |
3 | 122111000100111101112200010001 |
4 | 132103323000033030211000 |
5 | 114433124220024024100 |
6 | 1151305543410245344 |
7 | 40036234325506144 |
oct | 3623730017144500 |
9 | 574010441480101 |
10 | 133310420142400 |
11 | 395276a4858436 |
12 | 12b50551b86854 |
13 | 5950170975907 |
14 | 24cc38a085224 |
15 | 1062a9b19ad6a |
hex | 793ec03cc940 |
133310420142400 has 42 divisors (see below), whose sum is σ = 328026952566830. Its totient is φ = 53324168056320.
The previous prime is 133310420142391. The next prime is 133310420142413. The reversal of 133310420142400 is 4241024013331.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 2954493450496 + 130355926691904 = 1718864^2 + 11417352^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 41659504695 + ... + 41659507894.
Almost surely, 2133310420142400 is an apocalyptic number.
133310420142400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133310420142400 is an abundant number, since it is smaller than the sum of its proper divisors (194716532424430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133310420142400 is an equidigital number, since it uses as much as digits as its factorization.
133310420142400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83319012611 (or 83319012596 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 133310420142400 its reverse (4241024013331), we get a palindrome (137551444155731).
The spelling of 133310420142400 in words is "one hundred thirty-three trillion, three hundred ten billion, four hundred twenty million, one hundred forty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •