Base | Representation |
---|---|
bin | 110000111001101001… |
… | …0111001110010011001 |
3 | 101001001120112002020101 |
4 | 1201303102321302121 |
5 | 3210031432101413 |
6 | 120124220455401 |
7 | 10405222310014 |
oct | 1416322716231 |
9 | 331046462211 |
10 | 105013550233 |
11 | 40599458649 |
12 | 184289aa561 |
13 | 9b97403b07 |
14 | 5122c4c37b |
15 | 2ae946aedd |
hex | 18734b9c99 |
105013550233 has 2 divisors, whose sum is σ = 105013550234. Its totient is φ = 105013550232.
The previous prime is 105013550231. The next prime is 105013550321. The reversal of 105013550233 is 332055310501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99444361104 + 5569189129 = 315348^2 + 74627^2 .
It is a cyclic number.
It is not a de Polignac number, because 105013550233 - 21 = 105013550231 is a prime.
It is a super-2 number, since 2×1050135502332 (a number of 23 digits) contains 22 as substring.
Together with 105013550231, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (105013550231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52506775116 + 52506775117.
It is an arithmetic number, because the mean of its divisors is an integer number (52506775117).
Almost surely, 2105013550233 is an apocalyptic number.
It is an amenable number.
105013550233 is a deficient number, since it is larger than the sum of its proper divisors (1).
105013550233 is an equidigital number, since it uses as much as digits as its factorization.
105013550233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6750, while the sum is 28.
Adding to 105013550233 its reverse (332055310501), we get a palindrome (437068860734).
The spelling of 105013550233 in words is "one hundred five billion, thirteen million, five hundred fifty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •