Base | Representation |
---|---|
bin | 10000011100101101000… |
… | …010011001000000101101 |
3 | 11000001120210002000220022 |
4 | 100130231002121000231 |
5 | 122004404443002201 |
6 | 2223133425331525 |
7 | 144443452322210 |
oct | 20345502310055 |
9 | 4001523060808 |
10 | 1130332000301 |
11 | 3a6409a45839 |
12 | 163095a96ba5 |
13 | 82788b9374a |
14 | 3c9cba55777 |
15 | 1e60880a41b |
hex | 1072d09902d |
1130332000301 has 8 divisors (see below), whose sum is σ = 1291837138560. Its totient is φ = 968834146608.
The previous prime is 1130332000279. The next prime is 1130332000313. The reversal of 1130332000301 is 1030002330311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1130332000301 - 218 = 1130331738157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1130332000301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130332000381) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1484486 + ... + 2112903.
It is an arithmetic number, because the mean of its divisors is an integer number (161479642320).
Almost surely, 21130332000301 is an apocalyptic number.
It is an amenable number.
1130332000301 is a deficient number, since it is larger than the sum of its proper divisors (161505138259).
1130332000301 is an equidigital number, since it uses as much as digits as its factorization.
1130332000301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3642283.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1130332000301 its reverse (1030002330311), we get a palindrome (2160334330612).
The spelling of 1130332000301 in words is "one trillion, one hundred thirty billion, three hundred thirty-two million, three hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •