Base | Representation |
---|---|
bin | 111111011011110… |
… | …010111010001111 |
3 | 2202011120112221120 |
4 | 333123302322033 |
5 | 4134422013043 |
6 | 253334332023 |
7 | 35241661443 |
oct | 7733627217 |
9 | 2664515846 |
10 | 1064251023 |
11 | 4a6818600 |
12 | 2584ba013 |
13 | 13c645044 |
14 | a14b4823 |
15 | 63673983 |
hex | 3f6f2e8f |
1064251023 has 24 divisors (see below), whose sum is σ = 1561660464. Its totient is φ = 644202240.
The previous prime is 1064251003. The next prime is 1064251031. The reversal of 1064251023 is 3201524601.
It is not a de Polignac number, because 1064251023 - 25 = 1064250991 is a prime.
It is a super-2 number, since 2×10642510232 = 2265260479913093058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1064250984 and 1064251002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1064251003) 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, 439111 + ... + 441527.
It is an arithmetic number, because the mean of its divisors is an integer number (65069186).
Almost surely, 21064251023 is an apocalyptic number.
1064251023 is a deficient number, since it is larger than the sum of its proper divisors (497409441).
1064251023 is a wasteful number, since it uses less digits than its factorization.
1064251023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3655 (or 3644 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 1064251023 is about 32622.8604355903. The cubic root of 1064251023 is about 1020.9740224892.
Multiplying 1064251023 by its sum of digits (24), we get a palindrome (25542024552).
Adding to 1064251023 its reverse (3201524601), we get a palindrome (4265775624).
The spelling of 1064251023 in words is "one billion, sixty-four million, two hundred fifty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •