Base | Representation |
---|---|
bin | 1101111000010000010011… |
… | …01100110010010000111101 |
3 | 11000001200222020102002112102 |
4 | 12330020021230302100331 |
5 | 13000020332241344131 |
6 | 144524441513514445 |
7 | 6300004005335642 |
oct | 674101154622075 |
9 | 130050866362472 |
10 | 30520200340541 |
11 | 97a75a948336a |
12 | 350b029412a25 |
13 | 140507260ac42 |
14 | 777285325dc9 |
15 | 37dd7904d1cb |
hex | 1bc209b3243d |
30520200340541 has 4 divisors (see below), whose sum is σ = 30714596521212. Its totient is φ = 30325804159872.
The previous prime is 30520200340529. The next prime is 30520200340573. The reversal of 30520200340541 is 14504300202503.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9514973083225 + 21005227257316 = 3084635^2 + 4583146^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30520200340541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30520200330541) 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, 97198090100 + ... + 97198090413.
It is an arithmetic number, because the mean of its divisors is an integer number (7678649130303).
Almost surely, 230520200340541 is an apocalyptic number.
It is an amenable number.
30520200340541 is a deficient number, since it is larger than the sum of its proper divisors (194396180671).
30520200340541 is a wasteful number, since it uses less digits than its factorization.
30520200340541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194396180670.
The product of its (nonzero) digits is 14400, while the sum is 29.
The spelling of 30520200340541 in words is "thirty trillion, five hundred twenty billion, two hundred million, three hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •