Base | Representation |
---|---|
bin | 1111101011101111… |
… | …1011011001011110 |
3 | 101212101212212012200 |
4 | 3322323323121132 |
5 | 32110230420130 |
6 | 1533431112330 |
7 | 206220345453 |
oct | 37273733136 |
9 | 11771785180 |
10 | 4210013790 |
11 | 1870496744 |
12 | 995b126a6 |
13 | 5212a3928 |
14 | 2bd1c182a |
15 | 19990b760 |
hex | faefb65e |
4210013790 has 96 divisors (see below), whose sum is σ = 11604262176. Its totient is φ = 1055324160.
The previous prime is 4210013789. The next prime is 4210013813. The reversal of 4210013790 is 973100124.
It is a super-2 number, since 2×42100137902 = 35448432223980328200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2020089 + ... + 2022171.
It is an arithmetic number, because the mean of its divisors is an integer number (120877731).
Almost surely, 24210013790 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4210013790, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5802131088).
4210013790 is an abundant number, since it is smaller than the sum of its proper divisors (7394248386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4210013790 is a wasteful number, since it uses less digits than its factorization.
4210013790 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3434 (or 3431 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 4210013790 is about 64884.6190556745. The cubic root of 4210013790 is about 1614.7098930319.
The spelling of 4210013790 in words is "four billion, two hundred ten million, thirteen thousand, seven hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •