Base | Representation |
---|---|
bin | 1101110100110100011000… |
… | …10011011000011001001111 |
3 | 10222122102012212202212210112 |
4 | 12322122030103120121033 |
5 | 12441102031344140413 |
6 | 144354314040230235 |
7 | 6255324116446613 |
oct | 672321423303117 |
9 | 128572185685715 |
10 | 30402132411983 |
11 | 976152118a102 |
12 | 34b017876b37b |
13 | 13c6ba77a6217 |
14 | 771684835343 |
15 | 37ac689dd2a8 |
hex | 1ba68c4d864f |
30402132411983 has 2 divisors, whose sum is σ = 30402132411984. Its totient is φ = 30402132411982.
The previous prime is 30402132411943. The next prime is 30402132412007. The reversal of 30402132411983 is 38911423120403.
It is a strong prime.
It is an emirp because it is prime and its reverse (38911423120403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30402132411983 - 226 = 30402065303119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30402132411983.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30402132411943) 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 as a sum of consecutive naturals, namely, 15201066205991 + 15201066205992.
It is an arithmetic number, because the mean of its divisors is an integer number (15201066205992).
Almost surely, 230402132411983 is an apocalyptic number.
30402132411983 is a deficient number, since it is larger than the sum of its proper divisors (1).
30402132411983 is an equidigital number, since it uses as much as digits as its factorization.
30402132411983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 30402132411983 in words is "thirty trillion, four hundred two billion, one hundred thirty-two million, four hundred eleven thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •