Base | Representation |
---|---|
bin | 10000011100011101110… |
… | …000001010010011000001 |
3 | 11000000220220112200022221 |
4 | 100130131300022103001 |
5 | 122003343321010301 |
6 | 2223052145131041 |
7 | 144434216540164 |
oct | 20343560122301 |
9 | 4000826480287 |
10 | 1130075563201 |
11 | 3a6298215852 |
12 | 163024029a81 |
13 | 82747a09110 |
14 | 3c9a5981adb |
15 | 1e5e1053da1 |
hex | 1071dc0a4c1 |
1130075563201 has 8 divisors (see below), whose sum is σ = 1258970123880. Its totient is φ = 1007176098432.
The previous prime is 1130075563181. The next prime is 1130075563241. The reversal of 1130075563201 is 1023655700311.
It can be written as a sum of positive squares in 4 ways, for example, as 39563199025 + 1090512364176 = 198905^2 + 1044276^2 .
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 1130075563201 - 27 = 1130075563073 is a prime.
It is a super-3 number, since 3×11300755632013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1130075563241) 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, 1498773580 + ... + 1498774333.
It is an arithmetic number, because the mean of its divisors is an integer number (157371265485).
Almost surely, 21130075563201 is an apocalyptic number.
It is an amenable number.
1130075563201 is a deficient number, since it is larger than the sum of its proper divisors (128894560679).
1130075563201 is a wasteful number, since it uses less digits than its factorization.
1130075563201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2997547955.
The product of its (nonzero) digits is 18900, while the sum is 34.
The spelling of 1130075563201 in words is "one trillion, one hundred thirty billion, seventy-five million, five hundred sixty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •