Base | Representation |
---|---|
bin | 111101000000011101… |
… | …1001111101010110000 |
3 | 110112011110020212011221 |
4 | 1322000323033222300 |
5 | 4121303040030300 |
6 | 140104110314424 |
7 | 12315412623316 |
oct | 1720073175260 |
9 | 415143225157 |
10 | 131012033200 |
11 | 5061a971704 |
12 | 214837b8a14 |
13 | c47b765b49 |
14 | 64aba6a0b6 |
15 | 361bb2031a |
hex | 1e80ecfab0 |
131012033200 has 60 divisors (see below), whose sum is σ = 316514998440. Its totient is φ = 52112020480.
The previous prime is 131012033177. The next prime is 131012033203. The reversal of 131012033200 is 2330210131.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (131012033203) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 843289 + ... + 986488.
It is an arithmetic number, because the mean of its divisors is an integer number (5275249974).
Almost surely, 2131012033200 is an apocalyptic number.
131012033200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131012033200 is an abundant number, since it is smaller than the sum of its proper divisors (185502965240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131012033200 is a wasteful number, since it uses less digits than its factorization.
131012033200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1829974 (or 1829963 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 131012033200 its reverse (2330210131), we get a palindrome (133342243331).
The spelling of 131012033200 in words is "one hundred thirty-one billion, twelve million, thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •