Base | Representation |
---|---|
bin | 10001100001111110000111… |
… | …00110100011001010110011 |
3 | 12001111101212111211222222211 |
4 | 20300333003212203022303 |
5 | 20023103123431103433 |
6 | 213553523541512551 |
7 | 11056122063043324 |
oct | 1060770346431263 |
9 | 161441774758884 |
10 | 38550613144243 |
11 | 11313250120112 |
12 | 43a744a412757 |
13 | 18683cbc6c525 |
14 | 973c06b8844b |
15 | 46cbcae7e8cd |
hex | 230fc39a32b3 |
38550613144243 has 2 divisors, whose sum is σ = 38550613144244. Its totient is φ = 38550613144242.
The previous prime is 38550613144217. The next prime is 38550613144271. The reversal of 38550613144243 is 34244131605583.
38550613144243 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 38550613144243 - 225 = 38550579589811 is a prime.
It is a super-2 number, since 2×385506131442432 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (38550613144943) 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, 19275306572121 + 19275306572122.
It is an arithmetic number, because the mean of its divisors is an integer number (19275306572122).
Almost surely, 238550613144243 is an apocalyptic number.
38550613144243 is a deficient number, since it is larger than the sum of its proper divisors (1).
38550613144243 is an equidigital number, since it uses as much as digits as its factorization.
38550613144243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4147200, while the sum is 49.
The spelling of 38550613144243 in words is "thirty-eight trillion, five hundred fifty billion, six hundred thirteen million, one hundred forty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •