Base | Representation |
---|---|
bin | 11101101100001001000… |
… | …11111001100000011010 |
3 | 10121112010200220222222020 |
4 | 32312010203321200122 |
5 | 113203212100033000 |
6 | 2100350345035310 |
7 | 133462542400365 |
oct | 16660443714032 |
9 | 3545120828866 |
10 | 1020131252250 |
11 | 3636a9551750 |
12 | 14585ba85b36 |
13 | 75275c09c16 |
14 | 37535d370dc |
15 | 1b808cabba0 |
hex | ed848f981a |
1020131252250 has 128 divisors (see below), whose sum is σ = 2867329400832. Its totient is φ = 239326920000.
The previous prime is 1020131252243. The next prime is 1020131252263. The reversal of 1020131252250 is 522521310201.
It is a self number, because there is not a number n which added to its sum of digits gives 1020131252250.
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 63 ways as a sum of consecutive naturals, for example, 1738642 + ... + 2250141.
It is an arithmetic number, because the mean of its divisors is an integer number (22401010944).
Almost surely, 21020131252250 is an apocalyptic number.
1020131252250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1020131252250 is an abundant number, since it is smaller than the sum of its proper divisors (1847198148582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020131252250 is a wasteful number, since it uses less digits than its factorization.
1020131252250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3988845 (or 3988835 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 1020131252250 its reverse (522521310201), we get a palindrome (1542652562451).
The spelling of 1020131252250 in words is "one trillion, twenty billion, one hundred thirty-one million, two hundred fifty-two thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •