Base | Representation |
---|---|
bin | 1101110010011100000000… |
… | …00110001010111001101111 |
3 | 10222100121001110101112101022 |
4 | 12321032000012022321233 |
5 | 12433232010222244011 |
6 | 144252544134004355 |
7 | 6246366606133661 |
oct | 671160006127157 |
9 | 128317043345338 |
10 | 30320323243631 |
11 | 972a860027073 |
12 | 3498346aa66bb |
13 | 13bc26a8c11b5 |
14 | 76b7236b8531 |
15 | 378a7b7a48db |
hex | 1b938018ae6f |
30320323243631 has 2 divisors, whose sum is σ = 30320323243632. Its totient is φ = 30320323243630.
The previous prime is 30320323243627. The next prime is 30320323243703. The reversal of 30320323243631 is 13634232302303.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 30320323243631 - 22 = 30320323243627 is a prime.
It is a super-2 number, since 2×303203232436312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 30320323243591 and 30320323243600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30320323243621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15160161621815 + 15160161621816.
It is an arithmetic number, because the mean of its divisors is an integer number (15160161621816).
Almost surely, 230320323243631 is an apocalyptic number.
30320323243631 is a deficient number, since it is larger than the sum of its proper divisors (1).
30320323243631 is an equidigital number, since it uses as much as digits as its factorization.
30320323243631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968, while the sum is 35.
Adding to 30320323243631 its reverse (13634232302303), we get a palindrome (43954555545934).
The spelling of 30320323243631 in words is "thirty trillion, three hundred twenty billion, three hundred twenty-three million, two hundred forty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •