Base | Representation |
---|---|
bin | 1101111001001101110001… |
… | …10001110011100101010111 |
3 | 11000011212011012200110220012 |
4 | 12330212320301303211113 |
5 | 13001040424311044120 |
6 | 144551540351230435 |
7 | 6302252560504625 |
oct | 674467061634527 |
9 | 130155135613805 |
10 | 30553202440535 |
11 | 980a5a4291575 |
12 | 35154b981841b |
13 | 1408201941368 |
14 | 778ad6362515 |
15 | 37eb5b4d31c5 |
hex | 1bc9b8c73957 |
30553202440535 has 4 divisors (see below), whose sum is σ = 36663842928648. Its totient is φ = 24442561952424.
The previous prime is 30553202440493. The next prime is 30553202440567. The reversal of 30553202440535 is 53504420235503.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30553202440535 - 26 = 30553202440471 is a prime.
It is a super-2 number, since 2×305532024405352 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30553202440492 and 30553202440501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3055320244049 + ... + 3055320244058.
It is an arithmetic number, because the mean of its divisors is an integer number (9165960732162).
Almost surely, 230553202440535 is an apocalyptic number.
30553202440535 is a deficient number, since it is larger than the sum of its proper divisors (6110640488113).
30553202440535 is an equidigital number, since it uses as much as digits as its factorization.
30553202440535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6110640488112.
The product of its (nonzero) digits is 1080000, while the sum is 41.
The spelling of 30553202440535 in words is "thirty trillion, five hundred fifty-three billion, two hundred two million, four hundred forty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •