Base | Representation |
---|---|
bin | 1100010011011… |
… | …10110000000001 |
3 | 21012012211002202 |
4 | 12021232300001 |
5 | 202410322311 |
6 | 14124122545 |
7 | 2362206455 |
oct | 611566001 |
9 | 235184082 |
10 | 103214081 |
11 | 532972a3 |
12 | 2a696455 |
13 | 184ca729 |
14 | d9ca665 |
15 | 90dbe3b |
hex | 626ec01 |
103214081 has 2 divisors, whose sum is σ = 103214082. Its totient is φ = 103214080.
The previous prime is 103214077. The next prime is 103214119. The reversal of 103214081 is 180412301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56851600 + 46362481 = 7540^2 + 6809^2 .
It is an emirp because it is prime and its reverse (180412301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103214081 - 22 = 103214077 is a prime.
It is a super-2 number, since 2×1032140812 = 21306293033349122, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (103214011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51607040 + 51607041.
It is an arithmetic number, because the mean of its divisors is an integer number (51607041).
Almost surely, 2103214081 is an apocalyptic number.
It is an amenable number.
103214081 is a deficient number, since it is larger than the sum of its proper divisors (1).
103214081 is an equidigital number, since it uses as much as digits as its factorization.
103214081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
The square root of 103214081 is about 10159.4331042632. The cubic root of 103214081 is about 469.0793521578.
Adding to 103214081 its reverse (180412301), we get a palindrome (283626382).
The spelling of 103214081 in words is "one hundred three million, two hundred fourteen thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •