Base | Representation |
---|---|
bin | 1100001000010110… |
… | …1000001111101110 |
3 | 22101221012220202110 |
4 | 3002011220033232 |
5 | 23132100133340 |
6 | 1255040504450 |
7 | 143456500116 |
oct | 30205501756 |
9 | 8357186673 |
10 | 3256255470 |
11 | 1421086a26 |
12 | 76a61b126 |
13 | 3cb8072b0 |
14 | 22c670046 |
15 | 140d11680 |
hex | c21683ee |
3256255470 has 64 divisors (see below), whose sum is σ = 8459970624. Its totient is φ = 797368320.
The previous prime is 3256255441. The next prime is 3256255487. The reversal of 3256255470 is 745526523.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53640 + ... + 96900.
It is an arithmetic number, because the mean of its divisors is an integer number (132187041).
Almost surely, 23256255470 is an apocalyptic number.
3256255470 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3256255470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4229985312).
3256255470 is an abundant number, since it is smaller than the sum of its proper divisors (5203715154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3256255470 is a wasteful number, since it uses less digits than its factorization.
3256255470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43477.
The product of its (nonzero) digits is 252000, while the sum is 39.
The square root of 3256255470 is about 57063.6089815567. The cubic root of 3256255470 is about 1482.1977741124.
The spelling of 3256255470 in words is "three billion, two hundred fifty-six million, two hundred fifty-five thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •