Base | Representation |
---|---|
bin | 1101111110111000111000… |
… | …00110010101010001111111 |
3 | 11000212111022220102002111021 |
4 | 12333130130012111101333 |
5 | 13012234143411403033 |
6 | 145221300201005011 |
7 | 6322323426100351 |
oct | 677343406252177 |
9 | 130774286362437 |
10 | 30748142294143 |
11 | 98852397a48aa |
12 | 3547242783767 |
13 | 14206ca803171 |
14 | 78430a3a70d1 |
15 | 384c6a5beb2d |
hex | 1bf71c19547f |
30748142294143 has 2 divisors, whose sum is σ = 30748142294144. Its totient is φ = 30748142294142.
The previous prime is 30748142294119. The next prime is 30748142294167. The reversal of 30748142294143 is 34149224184703.
It is a balanced prime because it is at equal distance from previous prime (30748142294119) and next prime (30748142294167).
It is an emirp because it is prime and its reverse (34149224184703) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30748142294143 is a prime.
It is a super-2 number, since 2×307481422941432 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30748142294543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15374071147071 + 15374071147072.
It is an arithmetic number, because the mean of its divisors is an integer number (15374071147072).
Almost surely, 230748142294143 is an apocalyptic number.
30748142294143 is a deficient number, since it is larger than the sum of its proper divisors (1).
30748142294143 is an equidigital number, since it uses as much as digits as its factorization.
30748142294143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4644864, while the sum is 52.
The spelling of 30748142294143 in words is "thirty trillion, seven hundred forty-eight billion, one hundred forty-two million, two hundred ninety-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •