Base | Representation |
---|---|
bin | 111101001011101… |
… | …101011110111000 |
3 | 2122112111120220212 |
4 | 331023231132320 |
5 | 4100234330211 |
6 | 245505010252 |
7 | 34302636140 |
oct | 7513553670 |
9 | 2575446825 |
10 | 1026480056 |
11 | 48746a728 |
12 | 247923988 |
13 | 13487bc64 |
14 | 9a481920 |
15 | 601b238b |
hex | 3d2ed7b8 |
1026480056 has 64 divisors (see below), whose sum is σ = 2281305600. Its totient is φ = 423658368.
The previous prime is 1026479989. The next prime is 1026480061. The reversal of 1026480056 is 6500846201.
It is a super-2 number, since 2×10264800562 = 2107322610731526272, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1043741 + ... + 1044723.
It is an arithmetic number, because the mean of its divisors is an integer number (35645400).
Almost surely, 21026480056 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 1026480056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1140652800).
1026480056 is an abundant number, since it is smaller than the sum of its proper divisors (1254825544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026480056 is a wasteful number, since it uses less digits than its factorization.
1026480056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1668 (or 1664 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 1026480056 is about 32038.7274403963. The cubic root of 1026480056 is about 1008.7499012615.
The spelling of 1026480056 in words is "one billion, twenty-six million, four hundred eighty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •