Base | Representation |
---|---|
bin | 111101010001010000010… |
… | …000101001001100110010 |
3 | 112220111211000200022111220 |
4 | 331101100100221030302 |
5 | 1022440412102143133 |
6 | 12542123202445510 |
7 | 613122665445003 |
oct | 75212020511462 |
9 | 15814730608456 |
10 | 4210414490418 |
11 | 138369923a644 |
12 | 58000b363896 |
13 | 24706a94b076 |
14 | 107adc63b1aa |
15 | 747c88b45b3 |
hex | 3d450429332 |
4210414490418 has 8 divisors (see below), whose sum is σ = 8420828980848. Its totient is φ = 1403471496804.
The previous prime is 4210414490383. The next prime is 4210414490431. The reversal of 4210414490418 is 8140944140124.
It is a sphenic number, since it is the product of 3 distinct primes.
4210414490418 is an admirable number.
It is a super-2 number, since 2×42104144904182 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4210414490418.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 350867874196 + ... + 350867874207.
It is an arithmetic number, because the mean of its divisors is an integer number (1052603622606).
Almost surely, 24210414490418 is an apocalyptic number.
4210414490418 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4210414490418 is a wasteful number, since it uses less digits than its factorization.
4210414490418 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701735748408.
The product of its (nonzero) digits is 147456, while the sum is 42.
The spelling of 4210414490418 in words is "four trillion, two hundred ten billion, four hundred fourteen million, four hundred ninety thousand, four hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •