Base | Representation |
---|---|
bin | 100110110001101… |
… | …0110000101011010 |
3 | 10100200021021221010 |
4 | 1031203112011122 |
5 | 10131041024010 |
6 | 333035154350 |
7 | 44146155624 |
oct | 11543260532 |
9 | 3320237833 |
10 | 1301111130 |
11 | 608497060 |
12 | 3038a59b6 |
13 | 179736957 |
14 | c4b2dc14 |
15 | 7935e620 |
hex | 4d8d615a |
1301111130 has 64 divisors (see below), whose sum is σ = 3429236736. Its totient is φ = 313320000.
The previous prime is 1301111113. The next prime is 1301111221. The reversal of 1301111130 is 311111031.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36775 + ... + 62885.
It is an arithmetic number, because the mean of its divisors is an integer number (53581824).
Almost surely, 21301111130 is an apocalyptic number.
1301111130 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 1301111130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1714618368).
1301111130 is an abundant number, since it is smaller than the sum of its proper divisors (2128125606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301111130 is a wasteful number, since it uses less digits than its factorization.
1301111130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26283.
The product of its (nonzero) digits is 9, while the sum is 12.
The square root of 1301111130 is about 36070.9180642800. The cubic root of 1301111130 is about 1091.7037379430.
Adding to 1301111130 its reverse (311111031), we get a palindrome (1612222161).
Subtracting from 1301111130 its reverse (311111031), we obtain a palindrome (990000099).
The spelling of 1301111130 in words is "one billion, three hundred one million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •