Base | Representation |
---|---|
bin | 100001101011010… |
… | …0111001010000110 |
3 | 2220202022000000000 |
4 | 1003112213022012 |
5 | 4303240013110 |
6 | 304043502130 |
7 | 40000564434 |
oct | 10326471206 |
9 | 2822260000 |
10 | 1130001030 |
11 | 52a946554 |
12 | 276527946 |
13 | 150156282 |
14 | aa10bd54 |
15 | 693101c0 |
hex | 435a7286 |
1130001030 has 80 divisors (see below), whose sum is σ = 3051482544. Its totient is φ = 301281120.
The previous prime is 1130001011. The next prime is 1130001031. The reversal of 1130001030 is 301000311.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130001031) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 193960 + ... + 199700.
Almost surely, 21130001030 is an apocalyptic number.
1130001030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1130001030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1525741272).
1130001030 is an abundant number, since it is smaller than the sum of its proper divisors (1921481514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130001030 is an frugal number, since it uses more digits than its factorization.
1130001030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5775 (or 5751 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1130001030 is about 33615.4879482658. The cubic root of 1130001030 is about 1041.5807537749.
Adding to 1130001030 its reverse (301000311), we get a palindrome (1431001341).
The spelling of 1130001030 in words is "one billion, one hundred thirty million, one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •