Base | Representation |
---|---|
bin | 111101111001100… |
… | …010010110001101 |
3 | 2200101002220200021 |
4 | 331321202112031 |
5 | 4111323234234 |
6 | 251014302141 |
7 | 34510021405 |
oct | 7571422615 |
9 | 2611086607 |
10 | 1038493069 |
11 | 493225239 |
12 | 24b957951 |
13 | 1371c6b53 |
14 | 9bccb805 |
15 | 612869b4 |
hex | 3de6258d |
1038493069 has 2 divisors, whose sum is σ = 1038493070. Its totient is φ = 1038493068.
The previous prime is 1038493021. The next prime is 1038493123. The reversal of 1038493069 is 9603948301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 784728169 + 253764900 = 28013^2 + 15930^2 .
It is an emirp because it is prime and its reverse (9603948301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1038493069 - 213 = 1038484877 is a prime.
It is a super-2 number, since 2×10384930692 = 2156935708722077522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1038493019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 519246534 + 519246535.
It is an arithmetic number, because the mean of its divisors is an integer number (519246535).
Almost surely, 21038493069 is an apocalyptic number.
It is an amenable number.
1038493069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1038493069 is an equidigital number, since it uses as much as digits as its factorization.
1038493069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 43.
The square root of 1038493069 is about 32225.6585502919. The cubic root of 1038493069 is about 1012.6698207050.
The spelling of 1038493069 in words is "one billion, thirty-eight million, four hundred ninety-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •