Base | Representation |
---|---|
bin | 1101111001001000111111… |
… | …00000100110000010001101 |
3 | 11000011121112000002111120102 |
4 | 12330210133200212002031 |
5 | 13001020143014431131 |
6 | 144550433252500445 |
7 | 6302132054653061 |
oct | 674443740460215 |
9 | 130147460074512 |
10 | 30550631014541 |
11 | 98094a4833120 |
12 | 3514b0061a725 |
13 | 1407bb1c94311 |
14 | 778930a3baa1 |
15 | 37ea5a8991cb |
hex | 1bc91f82608d |
30550631014541 has 8 divisors (see below), whose sum is σ = 33332290068000. Its totient is φ = 27769693454640.
The previous prime is 30550631014457. The next prime is 30550631014543. The reversal of 30550631014541 is 14541013605503.
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 30550631014541 - 210 = 30550631013517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30550631014495 and 30550631014504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30550631014543) 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, 180284846 + ... + 180454223.
It is an arithmetic number, because the mean of its divisors is an integer number (4166536258500).
Almost surely, 230550631014541 is an apocalyptic number.
It is an amenable number.
30550631014541 is a deficient number, since it is larger than the sum of its proper divisors (2781659053459).
30550631014541 is a wasteful number, since it uses less digits than its factorization.
30550631014541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360746779.
The product of its (nonzero) digits is 108000, while the sum is 38.
It can be divided in two parts, 3055063 and 1014541, that added together give a palindrome (4069604).
The spelling of 30550631014541 in words is "thirty trillion, five hundred fifty billion, six hundred thirty-one million, fourteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •