Base | Representation |
---|---|
bin | 111101001011100… |
… | …110101001000010 |
3 | 2122112110011111000 |
4 | 331023212221002 |
5 | 4100232431114 |
6 | 245504232430 |
7 | 34302461346 |
oct | 7513465102 |
9 | 2575404430 |
10 | 1026452034 |
11 | 487450673 |
12 | 24790b716 |
13 | 13486c28a |
14 | 9a475626 |
15 | 601a8e09 |
hex | 3d2e6a42 |
1026452034 has 32 divisors (see below), whose sum is σ = 2283425280. Its totient is φ = 341787600.
The previous prime is 1026452003. The next prime is 1026452057. The reversal of 1026452034 is 4302546201.
1026452034 is a `hidden beast` number, since 10 + 2 + 645 + 2 + 0 + 3 + 4 = 666.
1026452034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1026451989 and 1026452007.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43924 + ... + 63104.
It is an arithmetic number, because the mean of its divisors is an integer number (71357040).
Almost surely, 21026452034 is an apocalyptic number.
1026452034 is an abundant number, since it is smaller than the sum of its proper divisors (1256973246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026452034 is a wasteful number, since it uses less digits than its factorization.
1026452034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20183 (or 20177 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 1026452034 is about 32038.2901229139. The cubic root of 1026452034 is about 1008.7407218505.
Adding to 1026452034 its reverse (4302546201), we get a palindrome (5328998235).
The spelling of 1026452034 in words is "one billion, twenty-six million, four hundred fifty-two thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •