Base | Representation |
---|---|
bin | 11110010001010100000000… |
… | …100001110000010111111000 |
3 | 122110101012122222002220022102 |
4 | 132101110000201300113320 |
5 | 114422210003142414000 |
6 | 1151051330534242532 |
7 | 40020256005500243 |
oct | 3621240041602770 |
9 | 573335588086272 |
10 | 133131110123000 |
11 | 3946864aa41960 |
12 | 12b2184b4b6448 |
13 | 5939295c73112 |
14 | 24c3819b7625a |
15 | 105d0a43363d5 |
hex | 7915008705f8 |
133131110123000 has 64 divisors (see below), whose sum is σ = 339847415687520. Its totient is φ = 48411312768000.
The previous prime is 133131110122937. The next prime is 133131110123027. The reversal of 133131110123000 is 321011131331.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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, 6051403097 + ... + 6051425096.
Almost surely, 2133131110123000 is an apocalyptic number.
133131110123000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133131110123000 is an abundant number, since it is smaller than the sum of its proper divisors (206716305564520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133131110123000 is a wasteful number, since it uses less digits than its factorization.
133131110123000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12102828225 (or 12102828211 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 133131110123000 its reverse (321011131331), we get a palindrome (133452121254331).
The spelling of 133131110123000 in words is "one hundred thirty-three trillion, one hundred thirty-one billion, one hundred ten million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •