Base | Representation |
---|---|
bin | 10000011100011111001… |
… | …110100010000111100000 |
3 | 11000000222122002120000000 |
4 | 100130133032202013200 |
5 | 122003421134133204 |
6 | 2223054431300000 |
7 | 144434640034641 |
oct | 20343716420740 |
9 | 4000878076000 |
10 | 1130100302304 |
11 | 3a6300182696 |
12 | 16303037a600 |
13 | 8274cb8b63c |
14 | 3c9a8d816c8 |
15 | 1e5e32de039 |
hex | 1071f3a21e0 |
1130100302304 has 384 divisors, whose sum is σ = 3426406945920. Its totient is φ = 366716160000.
The previous prime is 1130100302293. The next prime is 1130100302323. The reversal of 1130100302304 is 4032030010311.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 431170114 + ... + 431172734.
It is an arithmetic number, because the mean of its divisors is an integer number (8922934755).
Almost surely, 21130100302304 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1130100302304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1713203472960).
1130100302304 is an abundant number, since it is smaller than the sum of its proper divisors (2296306643616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130100302304 is an equidigital number, since it uses as much as digits as its factorization.
1130100302304 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2814 (or 2788 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1130100302304 its reverse (4032030010311), we get a palindrome (5162130312615).
The spelling of 1130100302304 in words is "one trillion, one hundred thirty billion, one hundred million, three hundred two thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •