Base | Representation |
---|---|
bin | 11110100100000001011… |
… | …01001010111100110000 |
3 | 10201101120110101121211221 |
4 | 33102000231022330300 |
5 | 114201132111021300 |
6 | 2122231303114424 |
7 | 135604143104260 |
oct | 17220055127460 |
9 | 3641513347757 |
10 | 1050131345200 |
11 | 3753a38495a3 |
12 | 14b632a42a14 |
13 | 78047305402 |
14 | 38b803a77a0 |
15 | 1c4b290331a |
hex | f480b4af30 |
1050131345200 has 120 divisors (see below), whose sum is σ = 3035116613120. Its totient is φ = 341095276800.
The previous prime is 1050131345191. The next prime is 1050131345203. The reversal of 1050131345200 is 25431310501.
It is a happy number.
It is a super-2 number, since 2×10501313452002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1050131345203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9816456 + ... + 9922855.
Almost surely, 21050131345200 is an apocalyptic number.
1050131345200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1050131345200 is an abundant number, since it is smaller than the sum of its proper divisors (1984985267920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050131345200 is a wasteful number, since it uses less digits than its factorization.
1050131345200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19739355 (or 19739344 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 1050131345200 its reverse (25431310501), we get a palindrome (1075562655701).
The spelling of 1050131345200 in words is "one trillion, fifty billion, one hundred thirty-one million, three hundred forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •