Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …110111011110000101000 |
3 | 10220011210220212102212210 |
4 | 100000221012323300220 |
5 | 121011203013430042 |
6 | 2201231524205120 |
7 | 142326004562610 |
oct | 20005106736050 |
9 | 3804726772783 |
10 | 1100201311272 |
11 | 394657a5a148 |
12 | 1592872397a0 |
13 | 7c99670137b |
14 | 3b37010ba40 |
15 | 1d9434b8a9c |
hex | 100291bbc28 |
1100201311272 has 64 divisors (see below), whose sum is σ = 3152188569600. Its totient is φ = 313467606720.
The previous prime is 1100201311267. The next prime is 1100201311273. The reversal of 1100201311272 is 2721131020011.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1100201311273) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9060604 + ... + 9181227.
It is an arithmetic number, because the mean of its divisors is an integer number (49252946400).
Almost surely, 21100201311272 is an apocalyptic number.
1100201311272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100201311272 is an abundant number, since it is smaller than the sum of its proper divisors (2051987258328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100201311272 is a wasteful number, since it uses less digits than its factorization.
1100201311272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18242206 (or 18242202 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 21.
Adding to 1100201311272 its reverse (2721131020011), we get a palindrome (3821332331283).
The spelling of 1100201311272 in words is "one trillion, one hundred billion, two hundred one million, three hundred eleven thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •