Base | Representation |
---|---|
bin | 101000111110111… |
… | …1011110001001101 |
3 | 10112211122220011102 |
4 | 1101331323301031 |
5 | 10304022040333 |
6 | 344243032445 |
7 | 46035631364 |
oct | 12175736115 |
9 | 3484586142 |
10 | 1375190093 |
11 | 646293742 |
12 | 32466b725 |
13 | 18bba2c64 |
14 | d08d47db |
15 | 80ae3ae8 |
hex | 51f7bc4d |
1375190093 has 2 divisors, whose sum is σ = 1375190094. Its totient is φ = 1375190092.
The previous prime is 1375190059. The next prime is 1375190123. The reversal of 1375190093 is 3900915731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 761042569 + 614147524 = 27587^2 + 24782^2 .
It is a cyclic number.
It is not a de Polignac number, because 1375190093 - 216 = 1375124557 is a prime.
It is a super-2 number, since 2×13751900932 = 3782295583770697298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1375190053) 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, 687595046 + 687595047.
It is an arithmetic number, because the mean of its divisors is an integer number (687595047).
Almost surely, 21375190093 is an apocalyptic number.
It is an amenable number.
1375190093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1375190093 is an equidigital number, since it uses as much as digits as its factorization.
1375190093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25515, while the sum is 38.
The square root of 1375190093 is about 37083.5555603828. Note that the first 4 decimals coincide. The cubic root of 1375190093 is about 1112.0412869291.
The spelling of 1375190093 in words is "one billion, three hundred seventy-five million, one hundred ninety thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •