Base | Representation |
---|---|
bin | 111111100100110… |
… | …101010101000110 |
3 | 2202100000220212222 |
4 | 333210311111012 |
5 | 4141023321410 |
6 | 253501212342 |
7 | 35301056654 |
oct | 7744652506 |
9 | 2670026788 |
10 | 1066620230 |
11 | 4a8096625 |
12 | 2592610b2 |
13 | 13cc94540 |
14 | a192ddd4 |
15 | 63990955 |
hex | 3f935546 |
1066620230 has 32 divisors (see below), whose sum is σ = 2106627264. Its totient is φ = 386395776.
The previous prime is 1066620199. The next prime is 1066620257. The reversal of 1066620230 is 320266601.
It is a super-2 number, since 2×10666202302 = 2275357430090505800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 1066620230.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70514 + ... + 84293.
It is an arithmetic number, because the mean of its divisors is an integer number (65832102).
Almost surely, 21066620230 is an apocalyptic number.
1066620230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1066620230 is a deficient number, since it is larger than the sum of its proper divisors (1040007034).
1066620230 is a wasteful number, since it uses less digits than its factorization.
1066620230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154880.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 1066620230 is about 32659.1523160048. The cubic root of 1066620230 is about 1021.7310826197.
Adding to 1066620230 its reverse (320266601), we get a palindrome (1386886831).
The spelling of 1066620230 in words is "one billion, sixty-six million, six hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •