Base | Representation |
---|---|
bin | 1101111011111001001011… |
… | …10100101100001101111001 |
3 | 11000111122200111200011112020 |
4 | 12331330211310230031321 |
5 | 13004042410403222203 |
6 | 145102120024305053 |
7 | 6312021163001151 |
oct | 675744564541571 |
9 | 130448614604466 |
10 | 30645226226553 |
11 | 9845627315a94 |
12 | 352b300312189 |
13 | 1413aa8b18453 |
14 | 77d345d4b761 |
15 | 382245370153 |
hex | 1bdf25d2c379 |
30645226226553 has 16 divisors (see below), whose sum is σ = 41353948560960. Its totient is φ = 20183343475904.
The previous prime is 30645226226497. The next prime is 30645226226561. The reversal of 30645226226553 is 35562262254603.
It is a cyclic number.
It is not a de Polignac number, because 30645226226553 - 28 = 30645226226297 is a prime.
It is a super-3 number, since 3×306452262265533 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30645226226496 and 30645226226505.
It is not an unprimeable number, because it can be changed into a prime (30645226226453) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5662783 + ... + 9662171.
It is an arithmetic number, because the mean of its divisors is an integer number (2584621785060).
Almost surely, 230645226226553 is an apocalyptic number.
It is an amenable number.
30645226226553 is a deficient number, since it is larger than the sum of its proper divisors (10708722334407).
30645226226553 is a wasteful number, since it uses less digits than its factorization.
30645226226553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4030248.
The product of its (nonzero) digits is 15552000, while the sum is 51.
The spelling of 30645226226553 in words is "thirty trillion, six hundred forty-five billion, two hundred twenty-six million, two hundred twenty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •