Base | Representation |
---|---|
bin | 1000100111001000… |
… | …10011101100100100 |
3 | 102221012110112211012 |
4 | 10103210103230210 |
5 | 33432023033020 |
6 | 2042432201352 |
7 | 222365665364 |
oct | 42344235444 |
9 | 12835415735 |
10 | 4623252260 |
11 | 1a62783940 |
12 | a90399258 |
13 | 588a9bb33 |
14 | 31c0309a4 |
15 | 1c0d377c5 |
hex | 113913b24 |
4623252260 has 48 divisors (see below), whose sum is σ = 10621134720. Its totient is φ = 1676471040.
The previous prime is 4623252253. The next prime is 4623252269. The reversal of 4623252260 is 622523264.
It is a super-2 number, since 2×46232522602 = 42748922919190215200, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4623252269) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49712 + ... + 108248.
It is an arithmetic number, because the mean of its divisors is an integer number (221273640).
Almost surely, 24623252260 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 4623252260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5310567360).
4623252260 is an abundant number, since it is smaller than the sum of its proper divisors (5997882460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4623252260 is a wasteful number, since it uses less digits than its factorization.
4623252260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58916 (or 58914 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
The square root of 4623252260 is about 67994.5016894749. The cubic root of 4623252260 is about 1665.9010306459.
The spelling of 4623252260 in words is "four billion, six hundred twenty-three million, two hundred fifty-two thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •