Base | Representation |
---|---|
bin | 1101111001001110001001… |
… | …00100010100111001001111 |
3 | 11000011212122222212101220110 |
4 | 12330213010210110321033 |
5 | 13001041330424433201 |
6 | 144552012134451103 |
7 | 6302260511640636 |
oct | 674470444247117 |
9 | 130155588771813 |
10 | 30553400233551 |
11 | 980a6959a7378 |
12 | 3515553b03a93 |
13 | 1408233904c50 |
14 | 778b1472c51d |
15 | 37eb6da536d6 |
hex | 1bc9c4914e4f |
30553400233551 has 32 divisors (see below), whose sum is σ = 45288261623808. Its totient is φ = 18194970136320.
The previous prime is 30553400233537. The next prime is 30553400233619. The reversal of 30553400233551 is 15533200435503.
It is not a de Polignac number, because 30553400233551 - 26 = 30553400233487 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30553400233051) 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 31 ways as a sum of consecutive naturals, for example, 37483210 + ... + 38289656.
It is an arithmetic number, because the mean of its divisors is an integer number (1415258175744).
Almost surely, 230553400233551 is an apocalyptic number.
30553400233551 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
30553400233551 is a deficient number, since it is larger than the sum of its proper divisors (14734861390257).
30553400233551 is a wasteful number, since it uses less digits than its factorization.
30553400233551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 837831.
The product of its (nonzero) digits is 405000, while the sum is 39.
The spelling of 30553400233551 in words is "thirty trillion, five hundred fifty-three billion, four hundred million, two hundred thirty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •