Base | Representation |
---|---|
bin | 111111100011100… |
… | …111011010101111 |
3 | 2202022102201010110 |
4 | 333203213122233 |
5 | 4140433113403 |
6 | 253450311103 |
7 | 35265260400 |
oct | 7743473257 |
9 | 2668381113 |
10 | 1066301103 |
11 | 4a799888a |
12 | 259128493 |
13 | 13cbb21ca |
14 | a18899a7 |
15 | 6392b103 |
hex | 3f8e76af |
1066301103 has 24 divisors (see below), whose sum is σ = 1662211200. Its totient is φ = 606236400.
The previous prime is 1066301101. The next prime is 1066301107. The reversal of 1066301103 is 3011036601.
It is not a de Polignac number, because 1066301103 - 21 = 1066301101 is a prime.
It is a super-2 number, since 2×10663011032 = 2273996084518033218, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1066301103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066301101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11028 + ... + 47478.
It is an arithmetic number, because the mean of its divisors is an integer number (69258800).
Almost surely, 21066301103 is an apocalyptic number.
1066301103 is a deficient number, since it is larger than the sum of its proper divisors (595910097).
1066301103 is a wasteful number, since it uses less digits than its factorization.
1066301103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36667 (or 36660 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
The square root of 1066301103 is about 32654.2662296981. The cubic root of 1066301103 is about 1021.6291736521.
Adding to 1066301103 its reverse (3011036601), we get a palindrome (4077337704).
The spelling of 1066301103 in words is "one billion, sixty-six million, three hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •