Base | Representation |
---|---|
bin | 1101101010100100100010… |
… | …00111010110111110011101 |
3 | 10221101202100222010010210221 |
4 | 12311102101013112332131 |
5 | 12414314423103001003 |
6 | 143524442530201341 |
7 | 6221020440044044 |
oct | 665222107267635 |
9 | 127352328103727 |
10 | 30050025828253 |
11 | 96361651a5272 |
12 | 3453a90a23251 |
13 | 139c922653162 |
14 | 75c6012c155b |
15 | 371a0ba717bd |
hex | 1b54911d6f9d |
30050025828253 has 4 divisors (see below), whose sum is σ = 30617007447708. Its totient is φ = 29483044208800.
The previous prime is 30050025828233. The next prime is 30050025828283. The reversal of 30050025828253 is 35282852005003.
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 15080694591769 + 14969331236484 = 3883387^2 + 3869022^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30050025828253 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 (30050025828233) 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, 283490809648 + ... + 283490809753.
It is an arithmetic number, because the mean of its divisors is an integer number (7654251861927).
Almost surely, 230050025828253 is an apocalyptic number.
It is an amenable number.
30050025828253 is a deficient number, since it is larger than the sum of its proper divisors (566981619455).
30050025828253 is an equidigital number, since it uses as much as digits as its factorization.
30050025828253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566981619454.
The product of its (nonzero) digits is 576000, while the sum is 43.
The spelling of 30050025828253 in words is "thirty trillion, fifty billion, twenty-five million, eight hundred twenty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •