Base | Representation |
---|---|
bin | 11111000001100101100… |
… | …11111001000011100101 |
3 | 10202220112200020222110002 |
4 | 33200302303321003211 |
5 | 114431134103301003 |
6 | 2133414324511045 |
7 | 140005403332550 |
oct | 17406263710345 |
9 | 3686480228402 |
10 | 1066004353253 |
11 | 3810a9737474 |
12 | 15272284b485 |
13 | 796a6987078 |
14 | 3984851d697 |
15 | 1cae11b1a88 |
hex | f832cf90e5 |
1066004353253 has 8 divisors (see below), whose sum is σ = 1218427202880. Its totient is φ = 913615632000.
The previous prime is 1066004353217. The next prime is 1066004353273. The reversal of 1066004353253 is 3523534006601.
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 1066004353253 - 234 = 1048824484069 is a prime.
It is a super-2 number, since 2×10660043532532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066004353213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8465123 + ... + 8590128.
It is an arithmetic number, because the mean of its divisors is an integer number (152303400360).
Almost surely, 21066004353253 is an apocalyptic number.
It is an amenable number.
1066004353253 is a deficient number, since it is larger than the sum of its proper divisors (152422849627).
1066004353253 is an equidigital number, since it uses as much as digits as its factorization.
1066004353253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17064187.
The product of its (nonzero) digits is 194400, while the sum is 38.
Adding to 1066004353253 its reverse (3523534006601), we get a palindrome (4589538359854).
The spelling of 1066004353253 in words is "one trillion, sixty-six billion, four million, three hundred fifty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •