Search a number
-
+
30104364554553 = 310034788184851
BaseRepresentation
bin1101101100001001101111…
…11101001001100100111001
310221120221121221000110000110
412312010313331021210321
512421212214311221203
6144005430521454533
76224653134434442
oct666046775114471
9127527557013013
1030104364554553
119657209a76633
123462516941449
1313a4aa2251243
147610b7d3a2c9
1537313c299d03
hex1b6137f49939

30104364554553 has 4 divisors (see below), whose sum is σ = 40139152739408. Its totient is φ = 20069576369700.

The previous prime is 30104364554543. The next prime is 30104364554599. The reversal of 30104364554553 is 35545546340103.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 30104364554553 - 25 = 30104364554521 is a prime.

It is a super-2 number, since 2×301043645545532 (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 (30104364554513) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5017394092423 + ... + 5017394092428.

It is an arithmetic number, because the mean of its divisors is an integer number (10034788184852).

Almost surely, 230104364554553 is an apocalyptic number.

It is an amenable number.

30104364554553 is a deficient number, since it is larger than the sum of its proper divisors (10034788184855).

30104364554553 is a wasteful number, since it uses less digits than its factorization.

30104364554553 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 10034788184854.

The product of its (nonzero) digits is 6480000, while the sum is 48.

The spelling of 30104364554553 in words is "thirty trillion, one hundred four billion, three hundred sixty-four million, five hundred fifty-four thousand, five hundred fifty-three".

Divisors: 1 3 10034788184851 30104364554553