Base | Representation |
---|---|
bin | 1101111100010100111100… |
… | …10000101110000100110011 |
3 | 11000120002011022000210210000 |
4 | 12332022132100232010303 |
5 | 13004313422211221003 |
6 | 145113023045241043 |
7 | 6313056434536341 |
oct | 676123620560463 |
9 | 130502138023700 |
10 | 30660131742003 |
11 | 98509860733a5 |
12 | 3532180103183 |
13 | 1415312c0228a |
14 | 77dd5b7b8991 |
15 | 382818c1e1a3 |
hex | 1be29e42e133 |
30660131742003 has 40 divisors (see below), whose sum is σ = 45864478676720. Its totient is φ = 20411742225600.
The previous prime is 30660131741963. The next prime is 30660131742011. The reversal of 30660131742003 is 30024713106603.
30660131742003 is a `hidden beast` number, since 3 + 0 + 6 + 601 + 3 + 1 + 7 + 42 + 0 + 0 + 3 = 666.
It is not a de Polignac number, because 30660131742003 - 216 = 30660131676467 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30660131742103) 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 39 ways as a sum of consecutive naturals, for example, 299653953 + ... + 299756253.
It is an arithmetic number, because the mean of its divisors is an integer number (1146611966918).
Almost surely, 230660131742003 is an apocalyptic number.
30660131742003 is a deficient number, since it is larger than the sum of its proper divisors (15204346934717).
30660131742003 is a wasteful number, since it uses less digits than its factorization.
30660131742003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107409 (or 107400 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 36.
Adding to 30660131742003 its reverse (30024713106603), we get a palindrome (60684844848606).
The spelling of 30660131742003 in words is "thirty trillion, six hundred sixty billion, one hundred thirty-one million, seven hundred forty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •