Base | Representation |
---|---|
bin | 1101111001010010010001… |
… | …11001111111101101011111 |
3 | 11000012002101201200221202112 |
4 | 12330221020321333231133 |
5 | 13001110402322201323 |
6 | 144553020330544235 |
7 | 6302366521643543 |
oct | 674511071775537 |
9 | 130162351627675 |
10 | 30555620506463 |
11 | 9810625213268 |
12 | 3515a7359807b |
13 | 14084c88b3cc0 |
14 | 778c85565a23 |
15 | 37ec4d927178 |
hex | 1bca48e7fb5f |
30555620506463 has 8 divisors (see below), whose sum is σ = 33708639508656. Its totient is φ = 27517256740800.
The previous prime is 30555620506451. The next prime is 30555620506501. The reversal of 30555620506463 is 36460502655503.
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 30555620506463 - 24 = 30555620506447 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 (30555620556463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28663808573 + ... + 28663809638.
It is an arithmetic number, because the mean of its divisors is an integer number (4213579938582).
Almost surely, 230555620506463 is an apocalyptic number.
30555620506463 is a deficient number, since it is larger than the sum of its proper divisors (3153019002193).
30555620506463 is a wasteful number, since it uses less digits than its factorization.
30555620506463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57327618265.
The product of its (nonzero) digits is 9720000, while the sum is 50.
The spelling of 30555620506463 in words is "thirty trillion, five hundred fifty-five billion, six hundred twenty million, five hundred six thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •