Base | Representation |
---|---|
bin | 1101111001001100000000… |
… | …01111111000001100110011 |
3 | 11000011202201010001211212111 |
4 | 12330212000033320030303 |
5 | 13001032004012204301 |
6 | 144551302311310151 |
7 | 6302220223210420 |
oct | 674460017701463 |
9 | 130152633054774 |
10 | 30552254022451 |
11 | 980a157999a77 |
12 | 351529407b357 |
13 | 14080b02c4625 |
14 | 778a46400d47 |
15 | 37eb030e0551 |
hex | 1bc9803f8333 |
30552254022451 has 8 divisors (see below), whose sum is σ = 34916944309760. Its totient is φ = 26187584377608.
The previous prime is 30552254022449. The next prime is 30552254022463. The reversal of 30552254022451 is 15422045225503.
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 30552254022451 - 21 = 30552254022449 is a prime.
It is a super-2 number, since 2×305522540224512 (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 (30552254022491) 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, 1847211 + ... + 8032228.
It is an arithmetic number, because the mean of its divisors is an integer number (4364618038720).
Almost surely, 230552254022451 is an apocalyptic number.
30552254022451 is a deficient number, since it is larger than the sum of its proper divisors (4364690287309).
30552254022451 is an equidigital number, since it uses as much as digits as its factorization.
30552254022451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10321233.
The product of its (nonzero) digits is 480000, while the sum is 40.
Adding to 30552254022451 its reverse (15422045225503), we get a palindrome (45974299247954).
The spelling of 30552254022451 in words is "thirty trillion, five hundred fifty-two billion, two hundred fifty-four million, twenty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •