Base | Representation |
---|---|
bin | 10000011100011111010… |
… | …101110100101001010000 |
3 | 11000000222202200122020221 |
4 | 100130133111310221100 |
5 | 122003422131310300 |
6 | 2223054540242424 |
7 | 144434662214032 |
oct | 20343725645120 |
9 | 4000882618227 |
10 | 1130102213200 |
11 | 3a6301268344 |
12 | 163030b40414 |
13 | 827503aa34c |
14 | 3c9a931bc52 |
15 | 1e5e356a31a |
hex | 1071f574a50 |
1130102213200 has 60 divisors (see below), whose sum is σ = 2761088770080. Its totient is φ = 444379166080.
The previous prime is 1130102213173. The next prime is 1130102213221. The reversal of 1130102213200 is 23122010311.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 23919244 + ... + 23966443.
It is an arithmetic number, because the mean of its divisors is an integer number (46018146168).
Almost surely, 21130102213200 is an apocalyptic number.
1130102213200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1130102213200 is an abundant number, since it is smaller than the sum of its proper divisors (1630986556880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130102213200 is a wasteful number, since it uses less digits than its factorization.
1130102213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47885764 (or 47885753 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1130102213200 its reverse (23122010311), we get a palindrome (1153224223511).
The spelling of 1130102213200 in words is "one trillion, one hundred thirty billion, one hundred two million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •