Base | Representation |
---|---|
bin | 11101001110110011010… |
… | …01111111001001000001 |
3 | 10120000110220100211022110 |
4 | 32213121221333021001 |
5 | 112423432013323434 |
6 | 2045223320325533 |
7 | 132364306666263 |
oct | 16473151771101 |
9 | 3500426324273 |
10 | 1004379042369 |
11 | 357a5587027a |
12 | 1427a46138a9 |
13 | 739355a1581 |
14 | 3687dc67b33 |
15 | 1b1d5e104e9 |
hex | e9d9a7f241 |
1004379042369 has 4 divisors (see below), whose sum is σ = 1339172056496. Its totient is φ = 669586028244.
The previous prime is 1004379042361. The next prime is 1004379042389. The reversal of 1004379042369 is 9632409734001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1004379042369 - 23 = 1004379042361 is a prime.
It is a super-3 number, since 3×10043790423693 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1004379042361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167396507059 + ... + 167396507064.
It is an arithmetic number, because the mean of its divisors is an integer number (334793014124).
Almost surely, 21004379042369 is an apocalyptic number.
It is an amenable number.
1004379042369 is a deficient number, since it is larger than the sum of its proper divisors (334793014127).
1004379042369 is an equidigital number, since it uses as much as digits as its factorization.
1004379042369 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334793014126.
The product of its (nonzero) digits is 979776, while the sum is 48.
The spelling of 1004379042369 in words is "one trillion, four billion, three hundred seventy-nine million, forty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •