Base | Representation |
---|---|
bin | 101101101110110101001100… |
… | …001001010011100000100011 |
3 | 222101010212110111101201111222 |
4 | 231232311030021103200203 |
5 | 202330304324024341003 |
6 | 1551433552410525255 |
7 | 60236120233354106 |
oct | 5556651411234043 |
9 | 871125414351458 |
10 | 201130301012003 |
11 | 590a4977513120 |
12 | 1a684496a3682b |
13 | 882c6768c284c |
14 | 3794a894d073d |
15 | 183bcd9cc7c38 |
hex | b6ed4c253823 |
201130301012003 has 8 divisors (see below), whose sum is σ = 220627110705456. Its totient is φ = 181835530797600.
The previous prime is 201130301011957. The next prime is 201130301012029. The reversal of 201130301012003 is 300210103031102.
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 201130301012003 - 28 = 201130301011747 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201130301012063) 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 7 ways as a sum of consecutive naturals, for example, 50509867676 + ... + 50509871657.
It is an arithmetic number, because the mean of its divisors is an integer number (27578388838182).
Almost surely, 2201130301012003 is an apocalyptic number.
201130301012003 is a deficient number, since it is larger than the sum of its proper divisors (19496809693453).
201130301012003 is a wasteful number, since it uses less digits than its factorization.
201130301012003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101019739525.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201130301012003 its reverse (300210103031102), we get a palindrome (501340404043105).
The spelling of 201130301012003 in words is "two hundred one trillion, one hundred thirty billion, three hundred one million, twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •