Base | Representation |
---|---|
bin | 11111000001101100011… |
… | …00110100100100111101 |
3 | 10202220200122021010011201 |
4 | 33200312030310210331 |
5 | 114431243133021112 |
6 | 2133424115415501 |
7 | 140006663600353 |
oct | 17406614644475 |
9 | 3686618233151 |
10 | 1066061220157 |
11 | 38112884840a |
12 | 1527398b4591 |
13 | 796b56a7c1b |
14 | 39851cc37d3 |
15 | 1cae6196257 |
hex | f83633493d |
1066061220157 has 8 divisors (see below), whose sum is σ = 1090867722560. Its totient is φ = 1041255371520.
The previous prime is 1066061220139. The next prime is 1066061220239. The reversal of 1066061220157 is 7510221606601.
It is a happy number.
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 1066061220157 - 211 = 1066061218109 is a prime.
It is a super-2 number, since 2×10660612201572 (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 (1066061220137) 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, 5042269 + ... + 5249437.
It is an arithmetic number, because the mean of its divisors is an integer number (136358465320).
Almost surely, 21066061220157 is an apocalyptic number.
It is an amenable number.
1066061220157 is a deficient number, since it is larger than the sum of its proper divisors (24806502403).
1066061220157 is a wasteful number, since it uses less digits than its factorization.
1066061220157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326883.
The product of its (nonzero) digits is 30240, while the sum is 37.
Adding to 1066061220157 its reverse (7510221606601), we get a palindrome (8576282826758).
The spelling of 1066061220157 in words is "one trillion, sixty-six billion, sixty-one million, two hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •