Base | Representation |
---|---|
bin | 1111110000110011… |
… | …1000010000000000 |
3 | 101220212210222122010 |
4 | 3330030320100000 |
5 | 32131144001220 |
6 | 1535510012520 |
7 | 206565620550 |
oct | 37414702000 |
9 | 11825728563 |
10 | 4231234560 |
11 | 1881470173 |
12 | 9a1047140 |
13 | 5257c38b7 |
14 | 2c1d47160 |
15 | 19b6ee1e0 |
hex | fc338400 |
4231234560 has 704 divisors, whose sum is σ = 16978636800. Its totient is φ = 878051328.
The previous prime is 4231234559. The next prime is 4231234573. The reversal of 4231234560 is 654321324.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 71715811 + ... + 71715869.
Almost surely, 24231234560 is an apocalyptic number.
4231234560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4231234560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8489318400).
4231234560 is an abundant number, since it is smaller than the sum of its proper divisors (12747402240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4231234560 is a wasteful number, since it uses less digits than its factorization.
4231234560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146 (or 128 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 4231234560 is about 65047.9404746991. The cubic root of 4231234560 is about 1617.4183541400.
Adding to 4231234560 its reverse (654321324), we get a palindrome (4885555884).
The spelling of 4231234560 in words is "four billion, two hundred thirty-one million, two hundred thirty-four thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •