Base | Representation |
---|---|
bin | 111101111001001… |
… | …011111011000011 |
3 | 2200100221020200102 |
4 | 331321023323003 |
5 | 4111312314334 |
6 | 251012313015 |
7 | 34506156542 |
oct | 7571137303 |
9 | 2610836612 |
10 | 1038401219 |
11 | 493172229 |
12 | 24b91276b |
13 | 1371940bb |
14 | 9bca6159 |
15 | 6126967e |
hex | 3de4bec3 |
1038401219 has 4 divisors (see below), whose sum is σ = 1063728120. Its totient is φ = 1013074320.
The previous prime is 1038401207. The next prime is 1038401233. The reversal of 1038401219 is 9121048301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1038401219 is a prime.
It is a super-2 number, since 2×10384012192 = 2156554183241371922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1038401191 and 1038401200.
It is not an unprimeable number, because it can be changed into a prime (1038401249) 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 3 ways as a sum of consecutive naturals, for example, 12663389 + ... + 12663470.
It is an arithmetic number, because the mean of its divisors is an integer number (265932030).
Almost surely, 21038401219 is an apocalyptic number.
1038401219 is a deficient number, since it is larger than the sum of its proper divisors (25326901).
1038401219 is an equidigital number, since it uses as much as digits as its factorization.
1038401219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25326900.
The product of its (nonzero) digits is 1728, while the sum is 29.
The square root of 1038401219 is about 32224.2334121388. The cubic root of 1038401219 is about 1012.6399644745.
The spelling of 1038401219 in words is "one billion, thirty-eight million, four hundred one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •