Base | Representation |
---|---|
bin | 1101101010101000101011… |
… | …10001011001100100101101 |
3 | 10221101222010002000000011110 |
4 | 12311110111301121210231 |
5 | 12414334002332111303 |
6 | 143525451432542233 |
7 | 6221126543331213 |
oct | 665242561314455 |
9 | 127358102000143 |
10 | 30052251441453 |
11 | 96370a752941a |
12 | 34543b2251979 |
13 | 139cbb8781b47 |
14 | 75c772b08cb3 |
15 | 371adc14c703 |
hex | 1b5515c5992d |
30052251441453 has 8 divisors (see below), whose sum is σ = 42178598514400. Its totient is φ = 18980369331408.
The previous prime is 30052251441449. The next prime is 30052251441607. The reversal of 30052251441453 is 35414415225003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30052251441453 - 22 = 30052251441449 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30052251441413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263616240658 + ... + 263616240771.
It is an arithmetic number, because the mean of its divisors is an integer number (5272324814300).
Almost surely, 230052251441453 is an apocalyptic number.
It is an amenable number.
30052251441453 is a deficient number, since it is larger than the sum of its proper divisors (12126347072947).
30052251441453 is a wasteful number, since it uses less digits than its factorization.
30052251441453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527232481451.
The product of its (nonzero) digits is 288000, while the sum is 39.
Adding to 30052251441453 its reverse (35414415225003), we get a palindrome (65466666666456).
The spelling of 30052251441453 in words is "thirty trillion, fifty-two billion, two hundred fifty-one million, four hundred forty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •