Base | Representation |
---|---|
bin | 10000011110100010111… |
… | …011110111101001111101 |
3 | 11000020200122000221112122 |
4 | 100132202323313221331 |
5 | 122022432330033201 |
6 | 2224102005012325 |
7 | 144543461133662 |
oct | 20364273675175 |
9 | 4006618027478 |
10 | 1132310002301 |
11 | 3a7234527a35 |
12 | 1635483b40a5 |
13 | 82a1290812a |
14 | 3cb38625a69 |
15 | 1e6c22c4e1b |
hex | 107a2ef7a7d |
1132310002301 has 8 divisors (see below), whose sum is σ = 1195973207520. Its totient is φ = 1069053591312.
The previous prime is 1132310002277. The next prime is 1132310002303. The reversal of 1132310002301 is 1032000132311.
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 1132310002301 - 226 = 1132242893437 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 1132310002301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132310002303) 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, 101692835 + ... + 101703968.
It is an arithmetic number, because the mean of its divisors is an integer number (149496650940).
Almost surely, 21132310002301 is an apocalyptic number.
It is an amenable number.
1132310002301 is a deficient number, since it is larger than the sum of its proper divisors (63663205219).
1132310002301 is a wasteful number, since it uses less digits than its factorization.
1132310002301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203397115.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1132310002301 its reverse (1032000132311), we get a palindrome (2164310134612).
The spelling of 1132310002301 in words is "one trillion, one hundred thirty-two billion, three hundred ten million, two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •