Base | Representation |
---|---|
bin | 1110100101011000… |
… | …1010100111001000 |
3 | 101002211120121212220 |
4 | 3221112022213020 |
5 | 31004203330320 |
6 | 1444245534040 |
7 | 166005055224 |
oct | 35126124710 |
9 | 11084517786 |
10 | 3914901960 |
11 | 1729950872 |
12 | 913114320 |
13 | 4a50c7a48 |
14 | 291d21784 |
15 | 17da65e40 |
hex | e958a9c8 |
3914901960 has 128 divisors (see below), whose sum is σ = 12149084160. Its totient is φ = 1008172800.
The previous prime is 3914901937. The next prime is 3914901961. The reversal of 3914901960 is 691094193.
It is not an unprimeable number, because it can be changed into a prime (3914901961) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2569759 + ... + 2571281.
It is an arithmetic number, because the mean of its divisors is an integer number (94914720).
Almost surely, 23914901960 is an apocalyptic number.
3914901960 is a gapful number since it is divisible by the number (30) 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 3914901960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6074542080).
3914901960 is an abundant number, since it is smaller than the sum of its proper divisors (8234182200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3914901960 is a wasteful number, since it uses less digits than its factorization.
3914901960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2259 (or 2255 counting only the distinct ones).
The product of its (nonzero) digits is 52488, while the sum is 42.
The square root of 3914901960 is about 62569.1773959032. The cubic root of 3914901960 is about 1576.0632055268.
The spelling of 3914901960 in words is "three billion, nine hundred fourteen million, nine hundred one thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •