Base | Representation |
---|---|
bin | 100101100011101… |
… | …1000011001101100 |
3 | 10020211100010021211 |
4 | 1023013120121230 |
5 | 10040104214111 |
6 | 325015004204 |
7 | 43141513510 |
oct | 11307303154 |
9 | 3224303254 |
10 | 1260226156 |
11 | 597401622 |
12 | 2b2069664 |
13 | 171120367 |
14 | bd52a140 |
15 | 75985521 |
hex | 4b1d866c |
1260226156 has 48 divisors (see below), whose sum is σ = 2603409984. Its totient is φ = 522602496.
The previous prime is 1260226111. The next prime is 1260226171. The reversal of 1260226156 is 6516220621.
It is a super-3 number, since 3×12602261563 (a number of 28 digits) contains 333 as substring.
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, 102516 + ... + 114148.
It is an arithmetic number, because the mean of its divisors is an integer number (54237708).
Almost surely, 21260226156 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 1260226156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1301704992).
1260226156 is an abundant number, since it is smaller than the sum of its proper divisors (1343183828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1260226156 is a wasteful number, since it uses less digits than its factorization.
1260226156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11770 (or 11768 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 1260226156 is about 35499.6641674256. The cubic root of 1260226156 is about 1080.1469153133.
Adding to 1260226156 its reverse (6516220621), we get a palindrome (7776446777).
The spelling of 1260226156 in words is "one billion, two hundred sixty million, two hundred twenty-six thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •