Base | Representation |
---|---|
bin | 10111011110101100001110… |
… | …111111001111001111010011 |
3 | 111112121221211011201002001221 |
4 | 113132230032333033033103 |
5 | 102013334434414444433 |
6 | 1003342521244505511 |
7 | 30515405622525046 |
oct | 2736541677171723 |
9 | 445557734632057 |
10 | 103264150156243 |
11 | 2a9a30977439aa |
12 | b6b934ab4b297 |
13 | 45809c949893b |
14 | 1b7002391cc5d |
15 | be120e22172d |
hex | 5deb0efcf3d3 |
103264150156243 has 2 divisors, whose sum is σ = 103264150156244. Its totient is φ = 103264150156242.
The previous prime is 103264150156217. The next prime is 103264150156247. The reversal of 103264150156243 is 342651051462301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103264150156243 - 217 = 103264150025171 is a prime.
It is a super-2 number, since 2×1032641501562432 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103264150156243.
It is not a weakly prime, because it can be changed into another prime (103264150156247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51632075078121 + 51632075078122.
It is an arithmetic number, because the mean of its divisors is an integer number (51632075078122).
Almost surely, 2103264150156243 is an apocalyptic number.
103264150156243 is a deficient number, since it is larger than the sum of its proper divisors (1).
103264150156243 is an equidigital number, since it uses as much as digits as its factorization.
103264150156243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 103264150156243 in words is "one hundred three trillion, two hundred sixty-four billion, one hundred fifty million, one hundred fifty-six thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •