Base | Representation |
---|---|
bin | 1101111001001000111111… |
… | …00101101101010100110001 |
3 | 11000011121112002121121111112 |
4 | 12330210133211231110301 |
5 | 13001020143340330441 |
6 | 144550433341323105 |
7 | 6302132102235344 |
oct | 674443745552461 |
9 | 130147462547445 |
10 | 30550632355121 |
11 | 98094a556933a |
12 | 3514b00b66495 |
13 | 1407bb2343568 |
14 | 778930caa45b |
15 | 37ea5aa614eb |
hex | 1bc91f96d531 |
30550632355121 has 4 divisors (see below), whose sum is σ = 30980922951744. Its totient is φ = 30120341758500.
The previous prime is 30550632355099. The next prime is 30550632355123. The reversal of 30550632355121 is 12155323605503.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30550632355121 is a prime.
It is a super-2 number, since 2×305506323551212 (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 (30550632355123) 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, 215145298205 + ... + 215145298346.
It is an arithmetic number, because the mean of its divisors is an integer number (7745230737936).
Almost surely, 230550632355121 is an apocalyptic number.
It is an amenable number.
30550632355121 is a deficient number, since it is larger than the sum of its proper divisors (430290596623).
30550632355121 is an equidigital number, since it uses as much as digits as its factorization.
30550632355121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430290596622.
The product of its (nonzero) digits is 405000, while the sum is 41.
The spelling of 30550632355121 in words is "thirty trillion, five hundred fifty billion, six hundred thirty-two million, three hundred fifty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •