Base | Representation |
---|---|
bin | 1101111001001010001001… |
… | …01001000110111010011011 |
3 | 11000011200010102100121120012 |
4 | 12330211010221012322123 |
5 | 13001022432011101410 |
6 | 144551015145352135 |
7 | 6302153361200021 |
oct | 674450451067233 |
9 | 130150112317505 |
10 | 30551254003355 |
11 | 9809794462908 |
12 | 351505519864b |
13 | 1407c8107b857 |
14 | 77898d68a711 |
15 | 37ea95408605 |
hex | 1bc944a46e9b |
30551254003355 has 8 divisors (see below), whose sum is σ = 36661575020112. Its totient is φ = 24440956391968.
The previous prime is 30551254003351. The next prime is 30551254003379. The reversal of 30551254003355 is 55330045215503.
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 30551254003355 - 22 = 30551254003351 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30551254003351) 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, 2838644 + ... + 8316273.
It is an arithmetic number, because the mean of its divisors is an integer number (4582696877514).
Almost surely, 230551254003355 is an apocalyptic number.
30551254003355 is a deficient number, since it is larger than the sum of its proper divisors (6110321016757).
30551254003355 is a wasteful number, since it uses less digits than its factorization.
30551254003355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11702685.
The product of its (nonzero) digits is 675000, while the sum is 41.
Adding to 30551254003355 its reverse (55330045215503), we get a palindrome (85881299218858).
The spelling of 30551254003355 in words is "thirty trillion, five hundred fifty-one billion, two hundred fifty-four million, three thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •