Base | Representation |
---|---|
bin | 10000011100100101111… |
… | …100011100111011111001 |
3 | 11000001021111011100021220 |
4 | 100130211330130323321 |
5 | 122004134012044001 |
6 | 2223113535022253 |
7 | 144440506005255 |
oct | 20344574347371 |
9 | 4001244140256 |
10 | 1130213003001 |
11 | 3a6358859365 |
12 | 16306206a989 |
13 | 8276a32b044 |
14 | 3c9b9d1b265 |
15 | 1e5ed151c36 |
hex | 10725f1cef9 |
1130213003001 has 4 divisors (see below), whose sum is σ = 1506950670672. Its totient is φ = 753475335332.
The previous prime is 1130213002931. The next prime is 1130213003041. The reversal of 1130213003001 is 1003003120311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1130213003001 - 225 = 1130179448569 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1130213003041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188368833831 + ... + 188368833836.
It is an arithmetic number, because the mean of its divisors is an integer number (376737667668).
Almost surely, 21130213003001 is an apocalyptic number.
It is an amenable number.
1130213003001 is a deficient number, since it is larger than the sum of its proper divisors (376737667671).
1130213003001 is an equidigital number, since it uses as much as digits as its factorization.
1130213003001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376737667670.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1130213003001 its reverse (1003003120311), we get a palindrome (2133216123312).
The spelling of 1130213003001 in words is "one trillion, one hundred thirty billion, two hundred thirteen million, three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •