Base | Representation |
---|---|
bin | 1100010011011… |
… | …10101111111111 |
3 | 21012012211002200 |
4 | 12021232233333 |
5 | 202410322304 |
6 | 14124122543 |
7 | 2362206453 |
oct | 611565777 |
9 | 235184080 |
10 | 103214079 |
11 | 532972a1 |
12 | 2a696453 |
13 | 184ca727 |
14 | d9ca663 |
15 | 90dbe39 |
hex | 626ebff |
103214079 has 12 divisors (see below), whose sum is σ = 149221800. Its totient is φ = 68747184.
The previous prime is 103214077. The next prime is 103214081. The reversal of 103214079 is 970412301.
It is an interprime number because it is at equal distance from previous prime (103214077) and next prime (103214081).
It is not a de Polignac number, because 103214079 - 21 = 103214077 is a prime.
It is a super-2 number, since 2×1032140792 = 21306292207636482, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103214071) 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 in 11 ways as a sum of consecutive naturals, for example, 6777 + ... + 15885.
It is an arithmetic number, because the mean of its divisors is an integer number (12435150).
Almost surely, 2103214079 is an apocalyptic number.
103214079 is a deficient number, since it is larger than the sum of its proper divisors (46007721).
103214079 is a wasteful number, since it uses less digits than its factorization.
103214079 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10374 (or 10371 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 103214079 is about 10159.4330058326. The cubic root of 103214079 is about 469.0793491280.
It can be divided in two parts, 10321 and 4079, that added together give a square (14400 = 1202).
The spelling of 103214079 in words is "one hundred three million, two hundred fourteen thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •