Base | Representation |
---|---|
bin | 1111001011100101… |
… | …0001111100010100 |
3 | 101112000000121222200 |
4 | 3302321101330110 |
5 | 31321211230342 |
6 | 1512211324500 |
7 | 202661536524 |
oct | 36271217424 |
9 | 11460017880 |
10 | 4075101972 |
11 | 180131a477 |
12 | 9588b0730 |
13 | 4cc358556 |
14 | 2a9303684 |
15 | 18cb5c94c |
hex | f2e51f14 |
4075101972 has 36 divisors (see below), whose sum is σ = 10310227200. Its totient is φ = 1357144272.
The previous prime is 4075101923. The next prime is 4075101973. The reversal of 4075101972 is 2791015704.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4075101973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9972 + ... + 90827.
It is an arithmetic number, because the mean of its divisors is an integer number (286395200).
Almost surely, 24075101972 is an apocalyptic number.
It is an amenable number.
4075101972 is an abundant number, since it is smaller than the sum of its proper divisors (6235125228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4075101972 is a wasteful number, since it uses less digits than its factorization.
4075101972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101932 (or 101927 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 36.
The square root of 4075101972 is about 63836.5253753680. The cubic root of 4075101972 is about 1597.2742617103.
The spelling of 4075101972 in words is "four billion, seventy-five million, one hundred one thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •