Base | Representation |
---|---|
bin | 1101110001110110100011… |
… | …10111010001001101011111 |
3 | 10222021200011110000202111002 |
4 | 12320323101313101031133 |
5 | 12432414322334420133 |
6 | 144235421244420515 |
7 | 6245055463304132 |
oct | 670732167211537 |
9 | 128250143022432 |
10 | 30300220232543 |
11 | 972228443a318 |
12 | 349447654773b |
13 | 13ba3b5a8a371 |
14 | 76a77785a219 |
15 | 3782a198bce8 |
hex | 1b8ed1dd135f |
30300220232543 has 8 divisors (see below), whose sum is σ = 30483166890288. Its totient is φ = 30117363240384.
The previous prime is 30300220232539. The next prime is 30300220232593. The reversal of 30300220232543 is 34523202200303.
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 30300220232543 - 22 = 30300220232539 is a prime.
It is a super-2 number, since 2×303002202325432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30300220232593) 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, 21738446 + ... + 23090267.
It is an arithmetic number, because the mean of its divisors is an integer number (3810395861286).
Almost surely, 230300220232543 is an apocalyptic number.
30300220232543 is a deficient number, since it is larger than the sum of its proper divisors (182946657745).
30300220232543 is a wasteful number, since it uses less digits than its factorization.
30300220232543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44832793.
The product of its (nonzero) digits is 25920, while the sum is 29.
Adding to 30300220232543 its reverse (34523202200303), we get a palindrome (64823422432846).
The spelling of 30300220232543 in words is "thirty trillion, three hundred billion, two hundred twenty million, two hundred thirty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •