Base | Representation |
---|---|
bin | 11100110010111100… |
… | …011000011100001111 |
3 | 2221210211102100020021 |
4 | 130302330120130033 |
5 | 1001310340214443 |
6 | 22112035203011 |
7 | 2143133036032 |
oct | 346274303417 |
9 | 87724370207 |
10 | 30919460623 |
11 | 12127258447 |
12 | 5baaa46467 |
13 | 2bb9a1353c |
14 | 16d45cd019 |
15 | c0e6eb9ed |
hex | 732f1870f |
30919460623 has 2 divisors, whose sum is σ = 30919460624. Its totient is φ = 30919460622.
The previous prime is 30919460581. The next prime is 30919460639. The reversal of 30919460623 is 32606491903.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30919460623 - 29 = 30919460111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30919460623.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30919460683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15459730311 + 15459730312.
It is an arithmetic number, because the mean of its divisors is an integer number (15459730312).
Almost surely, 230919460623 is an apocalyptic number.
30919460623 is a deficient number, since it is larger than the sum of its proper divisors (1).
30919460623 is an equidigital number, since it uses as much as digits as its factorization.
30919460623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 43.
The spelling of 30919460623 in words is "thirty billion, nine hundred nineteen million, four hundred sixty thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •