Base | Representation |
---|---|
bin | 1101111000100111010011… |
… | …00000110001110110111011 |
3 | 11000002212211120111011012212 |
4 | 12330103221200301312323 |
5 | 13000221123034132443 |
6 | 144534242503325335 |
7 | 6300621635200115 |
oct | 674235140616673 |
9 | 130085746434185 |
10 | 30532545224123 |
11 | 9801863885098 |
12 | 35114b375084b |
13 | 140628c056b97 |
14 | 777ad6a7c3b5 |
15 | 37e34cbe6618 |
hex | 1bc4e9831dbb |
30532545224123 has 4 divisors (see below), whose sum is σ = 30543254643048. Its totient is φ = 30521835805200.
The previous prime is 30532545224101. The next prime is 30532545224171. The reversal of 30532545224123 is 32142254523503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30532545224123 - 224 = 30532528446907 is a prime.
It is a super-2 number, since 2×305325452241232 (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 (30532542224123) 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, 5354705186 + ... + 5354710887.
It is an arithmetic number, because the mean of its divisors is an integer number (7635813660762).
Almost surely, 230532545224123 is an apocalyptic number.
30532545224123 is a deficient number, since it is larger than the sum of its proper divisors (10709418925).
30532545224123 is a wasteful number, since it uses less digits than its factorization.
30532545224123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10709418924.
The product of its (nonzero) digits is 864000, while the sum is 41.
Adding to 30532545224123 its reverse (32142254523503), we get a palindrome (62674799747626).
The spelling of 30532545224123 in words is "thirty trillion, five hundred thirty-two billion, five hundred forty-five million, two hundred twenty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •