Base | Representation |
---|---|
bin | 11110101000001000101… |
… | …11011100001101100001 |
3 | 10201121021101211011120201 |
4 | 33110010113130031201 |
5 | 114220143100204444 |
6 | 2123234411305201 |
7 | 136012654314403 |
oct | 17240427341541 |
9 | 3647241734521 |
10 | 1052340241249 |
11 | 3763276a4920 |
12 | 14bb4a74b201 |
13 | 78309b2ccab |
14 | 38d0d8bcb73 |
15 | 1c5917cadd4 |
hex | f5045dc361 |
1052340241249 has 8 divisors (see below), whose sum is σ = 1149375850560. Its totient is φ = 955532684400.
The previous prime is 1052340241247. The next prime is 1052340241279. The reversal of 1052340241249 is 9421420432501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052340241249 - 21 = 1052340241247 is a prime.
It is a super-3 number, since 3×10523402412493 (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 (1052340241247) 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 7 ways as a sum of consecutive naturals, for example, 57003462 + ... + 57021919.
It is an arithmetic number, because the mean of its divisors is an integer number (143671981320).
Almost surely, 21052340241249 is an apocalyptic number.
It is an amenable number.
1052340241249 is a deficient number, since it is larger than the sum of its proper divisors (97035609311).
1052340241249 is a wasteful number, since it uses less digits than its factorization.
1052340241249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114026231.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 1052340241249 in words is "one trillion, fifty-two billion, three hundred forty million, two hundred forty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •