Base | Representation |
---|---|
bin | 10111011011000001100111… |
… | …100100110100001010001011 |
3 | 111111201212120122202102111201 |
4 | 113123001213210310022023 |
5 | 102000223023213100324 |
6 | 1003031100001005031 |
7 | 30461250113042353 |
oct | 2733014744641213 |
9 | 444655518672451 |
10 | 103012233331339 |
11 | 2a906274212842 |
12 | b678564623777 |
13 | 4563020265037 |
14 | 1b61b66703b63 |
15 | bd98b7ec4444 |
hex | 5db06793428b |
103012233331339 has 2 divisors, whose sum is σ = 103012233331340. Its totient is φ = 103012233331338.
The previous prime is 103012233331313. The next prime is 103012233331369. The reversal of 103012233331339 is 933133332210301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103012233331339 - 29 = 103012233330827 is a prime.
It is a super-2 number, since 2×1030122333313392 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103012233331298 and 103012233331307.
It is not a weakly prime, because it can be changed into another prime (103012233331369) 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, 51506116665669 + 51506116665670.
It is an arithmetic number, because the mean of its divisors is an integer number (51506116665670).
Almost surely, 2103012233331339 is an apocalyptic number.
103012233331339 is a deficient number, since it is larger than the sum of its proper divisors (1).
103012233331339 is an equidigital number, since it uses as much as digits as its factorization.
103012233331339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 37.
The spelling of 103012233331339 in words is "one hundred three trillion, twelve billion, two hundred thirty-three million, three hundred thirty-one thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •