Base | Representation |
---|---|
bin | 1111100001000010… |
… | …1111001010010010 |
3 | 101202021102212212220 |
4 | 3320100233022102 |
5 | 32012233341132 |
6 | 1525145201510 |
7 | 205134036453 |
oct | 37020571222 |
9 | 11667385786 |
10 | 4165137042 |
11 | 1848125120 |
12 | 982a90296 |
13 | 514bc0441 |
14 | 2b725d12a |
15 | 1959e4a2c |
hex | f842f292 |
4165137042 has 64 divisors (see below), whose sum is σ = 9327467520. Its totient is φ = 1229278400.
The previous prime is 4165137019. The next prime is 4165137047. The reversal of 4165137042 is 2407315614.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 4165136994 and 4165137012.
It is not an unprimeable number, because it can be changed into a prime (4165137047) 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, 383584 + ... + 394292.
It is an arithmetic number, because the mean of its divisors is an integer number (145741680).
Almost surely, 24165137042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4165137042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4663733760).
4165137042 is an abundant number, since it is smaller than the sum of its proper divisors (5162330478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4165137042 is a wasteful number, since it uses less digits than its factorization.
4165137042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10879.
The product of its (nonzero) digits is 20160, while the sum is 33.
The square root of 4165137042 is about 64537.8729274525. The cubic root of 4165137042 is about 1608.9520387247.
The spelling of 4165137042 in words is "four billion, one hundred sixty-five million, one hundred thirty-seven thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •