Base | Representation |
---|---|
bin | 1101101001101101000011… |
… | …01111111000000100110101 |
3 | 10221021220111011001002011222 |
4 | 12310312201233320010311 |
5 | 12413322422432121343 |
6 | 143503035151040125 |
7 | 6215614351461644 |
oct | 664664157700465 |
9 | 127256434032158 |
10 | 30020240113973 |
11 | 962456aa1127a |
12 | 344a159810045 |
13 | 1399b867a7855 |
14 | 75adb74d735b |
15 | 370d66b74a68 |
hex | 1b4da1bf8135 |
30020240113973 has 2 divisors, whose sum is σ = 30020240113974. Its totient is φ = 30020240113972.
The previous prime is 30020240113951. The next prime is 30020240114027. The reversal of 30020240113973 is 37931104202003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21977559648529 + 8042680465444 = 4688023^2 + 2835962^2 .
It is an emirp because it is prime and its reverse (37931104202003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30020240113973 - 210 = 30020240112949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30020240113373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15010120056986 + 15010120056987.
It is an arithmetic number, because the mean of its divisors is an integer number (15010120056987).
Almost surely, 230020240113973 is an apocalyptic number.
It is an amenable number.
30020240113973 is a deficient number, since it is larger than the sum of its proper divisors (1).
30020240113973 is an equidigital number, since it uses as much as digits as its factorization.
30020240113973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27216, while the sum is 35.
Adding to 30020240113973 its reverse (37931104202003), we get a palindrome (67951344315976).
The spelling of 30020240113973 in words is "thirty trillion, twenty billion, two hundred forty million, one hundred thirteen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •