Base | Representation |
---|---|
bin | 111111100100110… |
… | …000101010100001 |
3 | 2202022222221200020 |
4 | 333210300222201 |
5 | 4141022213441 |
6 | 253500544053 |
7 | 35300650155 |
oct | 7744605241 |
9 | 2668887606 |
10 | 1066601121 |
11 | 4a8083233 |
12 | 259252029 |
13 | 13cc88931 |
14 | a1927065 |
15 | 63989e66 |
hex | 3f930aa1 |
1066601121 has 16 divisors (see below), whose sum is σ = 1491903360. Its totient is φ = 676874240.
The previous prime is 1066601117. The next prime is 1066601147. The reversal of 1066601121 is 1211066601.
1066601121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1066601121 - 22 = 1066601117 is a prime.
It is a super-2 number, since 2×10666011212 = 2275275902636913282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1066601091 and 1066601100.
It is not an unprimeable number, because it can be changed into a prime (1066601021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 80160 + ... + 92513.
It is an arithmetic number, because the mean of its divisors is an integer number (93243960).
Almost surely, 21066601121 is an apocalyptic number.
It is an amenable number.
1066601121 is a deficient number, since it is larger than the sum of its proper divisors (425302239).
1066601121 is a wasteful number, since it uses less digits than its factorization.
1066601121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172776.
The product of its (nonzero) digits is 432, while the sum is 24.
The square root of 1066601121 is about 32658.8597627045. The cubic root of 1066601121 is about 1021.7249809866.
Adding to 1066601121 its reverse (1211066601), we get a palindrome (2277667722).
The spelling of 1066601121 in words is "one billion, sixty-six million, six hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •