Base | Representation |
---|---|
bin | 10000011110011100111… |
… | …111001010010111110100 |
3 | 11000020102200020120101220 |
4 | 100132130333022113310 |
5 | 122022231302431400 |
6 | 2224044041550340 |
7 | 144541136633205 |
oct | 20363477122764 |
9 | 4006380216356 |
10 | 1132210202100 |
11 | 3a719316262a |
12 | 16351aaa53b0 |
13 | 829c8034563 |
14 | 3cb292875ac |
15 | 1e6b865e7a0 |
hex | 1079cfca5f4 |
1132210202100 has 72 divisors (see below), whose sum is σ = 3276373527840. Its totient is φ = 301875530880.
The previous prime is 1132210202089. The next prime is 1132210202113. The reversal of 1132210202100 is 12020122311.
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 1132210202100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1648999 + ... + 2232401.
Almost surely, 21132210202100 is an apocalyptic number.
1132210202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1132210202100 is an abundant number, since it is smaller than the sum of its proper divisors (2144163325740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132210202100 is a wasteful number, since it uses less digits than its factorization.
1132210202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589889 (or 589882 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1132210202100 its reverse (12020122311), we get a palindrome (1144230324411).
The spelling of 1132210202100 in words is "one trillion, one hundred thirty-two billion, two hundred ten million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •