Base | Representation |
---|---|
bin | 1101101100111010000011… |
… | …11101001010001100001011 |
3 | 10221200102120120010221200011 |
4 | 12312131001331022030023 |
5 | 12422123324321224003 |
6 | 144025400354052351 |
7 | 6226561655265622 |
oct | 666350175121413 |
9 | 127612516127604 |
10 | 30130302133003 |
11 | 966720a071186 |
12 | 346755527a0b7 |
13 | 13a7376aaa6b7 |
14 | 762458a226b9 |
15 | 373b5941d46d |
hex | 1b6741f4a30b |
30130302133003 has 8 divisors (see below), whose sum is σ = 30772169395200. Its totient is φ = 29488468079400.
The previous prime is 30130302132907. The next prime is 30130302133111. The reversal of 30130302133003 is 30033120303103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30130302133003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30130302133703) 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, 6463923 + ... + 10101628.
It is an arithmetic number, because the mean of its divisors is an integer number (3846521174400).
Almost surely, 230130302133003 is an apocalyptic number.
30130302133003 is a deficient number, since it is larger than the sum of its proper divisors (641867262197).
30130302133003 is a wasteful number, since it uses less digits than its factorization.
30130302133003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16604297.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 30130302133003 its reverse (30033120303103), we get a palindrome (60163422436106).
The spelling of 30130302133003 in words is "thirty trillion, one hundred thirty billion, three hundred two million, one hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.344 sec. • engine limits •