Base | Representation |
---|---|
bin | 10000011101100111010… |
… | …110000000001101000100 |
3 | 11000011002221202202012020 |
4 | 100131213112000031010 |
5 | 122013410404020400 |
6 | 2223414452123140 |
7 | 144506631131034 |
oct | 20354726001504 |
9 | 4004087682166 |
10 | 1131310220100 |
11 | 3a6871142855 |
12 | 1633096064b0 |
13 | 828b3746128 |
14 | 3ca819338c4 |
15 | 1e6646382a0 |
hex | 10767580344 |
1131310220100 has 72 divisors (see below), whose sum is σ = 3273751716480. Its totient is φ = 301637182080.
The previous prime is 1131310220057. The next prime is 1131310220191. The reversal of 1131310220100 is 10220131311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1131310220100.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1729606 + ... + 2292194.
It is an arithmetic number, because the mean of its divisors is an integer number (45468773840).
Almost surely, 21131310220100 is an apocalyptic number.
1131310220100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1131310220100 is an abundant number, since it is smaller than the sum of its proper divisors (2142441496380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131310220100 is a wasteful number, since it uses less digits than its factorization.
1131310220100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 569309 (or 569302 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1131310220100 its reverse (10220131311), we get a palindrome (1141530351411).
The spelling of 1131310220100 in words is "one trillion, one hundred thirty-one billion, three hundred ten million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •