Base | Representation |
---|---|
bin | 1101111000101000111110… |
… | …11100101111010111100111 |
3 | 11000002222011122020101121002 |
4 | 12330110133130233113213 |
5 | 13000230001213310030 |
6 | 144534512350543515 |
7 | 6300653233621232 |
oct | 674243734572747 |
9 | 130088148211532 |
10 | 30533450135015 |
11 | 9802188661033 |
12 | 3511706807b9b |
13 | 14063a467c909 |
14 | 777b80d16419 |
15 | 37e3a2393245 |
hex | 1bc51f72f5e7 |
30533450135015 has 8 divisors (see below), whose sum is σ = 36903738293520. Its totient is φ = 24251028020352.
The previous prime is 30533450134973. The next prime is 30533450135029. The reversal of 30533450135015 is 51053105433503.
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 30533450135015 - 236 = 30464730658279 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30533450135015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21966510194 + ... + 21966511583.
It is an arithmetic number, because the mean of its divisors is an integer number (4612967286690).
Almost surely, 230533450135015 is an apocalyptic number.
30533450135015 is a deficient number, since it is larger than the sum of its proper divisors (6370288158505).
30533450135015 is a wasteful number, since it uses less digits than its factorization.
30533450135015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43933021921.
The product of its (nonzero) digits is 202500, while the sum is 38.
Adding to 30533450135015 its reverse (51053105433503), we get a palindrome (81586555568518).
The spelling of 30533450135015 in words is "thirty trillion, five hundred thirty-three billion, four hundred fifty million, one hundred thirty-five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •