Base | Representation |
---|---|
bin | 111101001010001… |
… | …010000001011100 |
3 | 2122111201220002102 |
4 | 331022022001130 |
5 | 4100133311133 |
6 | 245452144232 |
7 | 34266321335 |
oct | 7512120134 |
9 | 2574656072 |
10 | 1026072668 |
11 | 487211645 |
12 | 247768078 |
13 | 1347686ba |
14 | 9a3b728c |
15 | 601317e8 |
hex | 3d28a05c |
1026072668 has 12 divisors (see below), whose sum is σ = 1795966872. Its totient is φ = 512939280.
The previous prime is 1026072667. The next prime is 1026072673. The reversal of 1026072668 is 8662706201.
It is a happy number.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1026072661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2903 + ... + 45393.
It is an arithmetic number, because the mean of its divisors is an integer number (149663906).
Almost surely, 21026072668 is an apocalyptic number.
It is an amenable number.
1026072668 is a deficient number, since it is larger than the sum of its proper divisors (769894204).
1026072668 is a wasteful number, since it uses less digits than its factorization.
1026072668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48532 (or 48530 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The square root of 1026072668 is about 32032.3690663054. The cubic root of 1026072668 is about 1008.6164331763.
Adding to 1026072668 its reverse (8662706201), we get a palindrome (9688778869).
It can be divided in two parts, 10260 and 72668, that added together give a palindrome (82928).
The spelling of 1026072668 in words is "one billion, twenty-six million, seventy-two thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •