Base | Representation |
---|---|
bin | 1111110111101101… |
… | …1110001111110000 |
3 | 101222220100220110100 |
4 | 3331323132033300 |
5 | 32211104213112 |
6 | 1542423232400 |
7 | 210400216026 |
oct | 37573361760 |
9 | 11886326410 |
10 | 4260226032 |
11 | 1896871967 |
12 | 9aa8a8700 |
13 | 52b80480a |
14 | 2c5b32716 |
15 | 19e0292dc |
hex | fdede3f0 |
4260226032 has 240 divisors, whose sum is σ = 12699374688. Its totient is φ = 1331527680.
The previous prime is 4260226007. The next prime is 4260226051. The reversal of 4260226032 is 2306220624.
4260226032 is a `hidden beast` number, since 4 + 2 + 602 + 26 + 0 + 32 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 4260225987 and 4260226005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24625498 + ... + 24625670.
Almost surely, 24260226032 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 4260226032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6349687344).
4260226032 is an abundant number, since it is smaller than the sum of its proper divisors (8439148656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4260226032 is a wasteful number, since it uses less digits than its factorization.
4260226032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368 (or 359 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 4260226032 is about 65270.4070157372. The cubic root of 4260226032 is about 1621.1040119748.
Adding to 4260226032 its reverse (2306220624), we get a palindrome (6566446656).
The spelling of 4260226032 in words is "four billion, two hundred sixty million, two hundred twenty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •