Base | Representation |
---|---|
bin | 1101110011011000111001… |
… | …11111001010101001010001 |
3 | 10222110201110011111002111212 |
4 | 12321230130333022221101 |
5 | 12434300441132422203 |
6 | 144315552431145505 |
7 | 6251635064525630 |
oct | 671543477125121 |
9 | 128421404432455 |
10 | 30353020201553 |
11 | 9742709669545 |
12 | 34a2751075295 |
13 | 13c237b94618a |
14 | 76d145da3517 |
15 | 3798420621d8 |
hex | 1b9b1cfcaa51 |
30353020201553 has 8 divisors (see below), whose sum is σ = 34713373329408. Its totient is φ = 25998718919904.
The previous prime is 30353020201507. The next prime is 30353020201577. The reversal of 30353020201553 is 35510202035303.
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 30353020201553 - 28 = 30353020201297 is a prime.
It is a super-2 number, since 2×303530202015532 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30353020201583) 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, 1512950801 + ... + 1512970862.
It is an arithmetic number, because the mean of its divisors is an integer number (4339171666176).
Almost surely, 230353020201553 is an apocalyptic number.
It is an amenable number.
30353020201553 is a deficient number, since it is larger than the sum of its proper divisors (4360353127855).
30353020201553 is a wasteful number, since it uses less digits than its factorization.
30353020201553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3025923103.
The product of its (nonzero) digits is 40500, while the sum is 32.
Adding to 30353020201553 its reverse (35510202035303), we get a palindrome (65863222236856).
The spelling of 30353020201553 in words is "thirty trillion, three hundred fifty-three billion, twenty million, two hundred one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •