Base | Representation |
---|---|
bin | 1101101001100101101000… |
… | …01110110111100101001011 |
3 | 10221021112012102211120112221 |
4 | 12310302310032313211023 |
5 | 12413241242321323003 |
6 | 143501135521514511 |
7 | 6215413534002544 |
oct | 664626416674513 |
9 | 127245172746487 |
10 | 30016255261003 |
11 | 9622905633260 |
12 | 34494271a2a37 |
13 | 13996a005a69b |
14 | 75ab1a1a74cb |
15 | 370bd1de27bd |
hex | 1b4cb43b794b |
30016255261003 has 8 divisors (see below), whose sum is σ = 33034784552496. Its totient is φ = 27046022438400.
The previous prime is 30016255260913. The next prime is 30016255261007.
30016255261003 is nontrivially palindromic in base 10.
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-30016255261003 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30016255261003.
It is not an unprimeable number, because it can be changed into a prime (30016255261007) 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, 12074115918 + ... + 12074118403.
It is an arithmetic number, because the mean of its divisors is an integer number (4129348069062).
Almost surely, 230016255261003 is an apocalyptic number.
30016255261003 is a deficient number, since it is larger than the sum of its proper divisors (3018529291493).
30016255261003 is a wasteful number, since it uses less digits than its factorization.
30016255261003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24148234445.
The product of its (nonzero) digits is 32400, while the sum is 34.
It can be divided in two parts, 3001625 and 5261003, that added together give a palindrome (8262628).
The spelling of 30016255261003 in words is "thirty trillion, sixteen billion, two hundred fifty-five million, two hundred sixty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •