Base | Representation |
---|---|
bin | 10000011100011010000… |
… | …001100101101100011000 |
3 | 11000000202112212022022012 |
4 | 100130122001211230120 |
5 | 122003231313214000 |
6 | 2223042032445052 |
7 | 144432530133221 |
oct | 20343201455430 |
9 | 4000675768265 |
10 | 1130013023000 |
11 | 3a626598a434 |
12 | 1630070a9788 |
13 | 82737a7cb94 |
14 | 3c99b542248 |
15 | 1e5da7ed735 |
hex | 1071a065b18 |
1130013023000 has 256 divisors, whose sum is σ = 2853107712000. Its totient is φ = 417686016000.
The previous prime is 1130013022993. The next prime is 1130013023021. The reversal of 1130013023000 is 3203100311.
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, 598206056 + ... + 598207944.
It is an arithmetic number, because the mean of its divisors is an integer number (11144952000).
Almost surely, 21130013023000 is an apocalyptic number.
1130013023000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1130013023000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1426553856000).
1130013023000 is an abundant number, since it is smaller than the sum of its proper divisors (1723094689000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130013023000 is a wasteful number, since it uses less digits than its factorization.
1130013023000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2803 (or 2789 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1130013023000 its reverse (3203100311), we get a palindrome (1133216123311).
The spelling of 1130013023000 in words is "one trillion, one hundred thirty billion, thirteen million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •