Base | Representation |
---|---|
bin | 10000011100101100011… |
… | …000100010111101011011 |
3 | 11000001120000102201212000 |
4 | 100130230120202331123 |
5 | 122004344140443003 |
6 | 2223132354252043 |
7 | 144443260144563 |
oct | 20345430427533 |
9 | 4001500381760 |
10 | 1130321031003 |
11 | 3a64038333aa |
12 | 163092287023 |
13 | 82786822938 |
14 | 3c9ca3dbda3 |
15 | 1e6078901a3 |
hex | 1072c622f5b |
1130321031003 has 8 divisors (see below), whose sum is σ = 1674549675600. Its totient is φ = 753547353984.
The previous prime is 1130321030989. The next prime is 1130321031017. The reversal of 1130321031003 is 3001301230311.
It is a happy number.
1130321031003 is a `hidden beast` number, since 1 + 1 + 30 + 321 + 0 + 310 + 0 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (1130321030989) and next prime (1130321031017).
It is not a de Polignac number, because 1130321031003 - 213 = 1130321022811 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1130321031023) 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, 20931870918 + ... + 20931870971.
It is an arithmetic number, because the mean of its divisors is an integer number (209318709450).
Almost surely, 21130321031003 is an apocalyptic number.
1130321031003 is a deficient number, since it is larger than the sum of its proper divisors (544228644597).
1130321031003 is an equidigital number, since it uses as much as digits as its factorization.
1130321031003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41863741898 (or 41863741892 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1130321031003 its reverse (3001301230311), we get a palindrome (4131622261314).
The spelling of 1130321031003 in words is "one trillion, one hundred thirty billion, three hundred twenty-one million, thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •