Base | Representation |
---|---|
bin | 111101001010111… |
… | …010010100001100 |
3 | 2122112002221102122 |
4 | 331022322110030 |
5 | 4100211123401 |
6 | 245500312112 |
7 | 34301104130 |
oct | 7512722414 |
9 | 2575087378 |
10 | 1026270476 |
11 | 487337220 |
12 | 247842638 |
13 | 13480774a |
14 | 9a4293c0 |
15 | 6017021b |
hex | 3d2ba50c |
1026270476 has 48 divisors (see below), whose sum is σ = 2262285312. Its totient is φ = 395712000.
The previous prime is 1026270463. The next prime is 1026270523. The reversal of 1026270476 is 6740726201.
1026270476 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 12701 + ... + 47051.
It is an arithmetic number, because the mean of its divisors is an integer number (47130944).
Almost surely, 21026270476 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1026270476, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1131142656).
1026270476 is an abundant number, since it is smaller than the sum of its proper divisors (1236014836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026270476 is a wasteful number, since it uses less digits than its factorization.
1026270476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34470 (or 34468 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 35.
The square root of 1026270476 is about 32035.4565442729. The cubic root of 1026270476 is about 1008.6812432644.
Adding to 1026270476 its reverse (6740726201), we get a palindrome (7766996677).
The spelling of 1026270476 in words is "one billion, twenty-six million, two hundred seventy thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •