Base | Representation |
---|---|
bin | 1111100000010001… |
… | …0001000100011110 |
3 | 101202001021210200120 |
4 | 3320010101010132 |
5 | 32010414234222 |
6 | 1524551135410 |
7 | 205064203062 |
oct | 37004210436 |
9 | 11661253616 |
10 | 4161868062 |
11 | 18462a2090 |
12 | 981974566 |
13 | 514317531 |
14 | 2b6a4baa2 |
15 | 19559b15c |
hex | f811111e |
4161868062 has 16 divisors (see below), whose sum is σ = 9080439552. Its totient is φ = 1261172120.
The previous prime is 4161868037. The next prime is 4161868069. The reversal of 4161868062 is 2608681614.
It is a super-2 number, since 2×41618680622 = 34642291530991271688, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4161868069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31529238 + ... + 31529369.
It is an arithmetic number, because the mean of its divisors is an integer number (567527472).
Almost surely, 24161868062 is an apocalyptic number.
4161868062 is an abundant number, since it is smaller than the sum of its proper divisors (4918571490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4161868062 is a wasteful number, since it uses less digits than its factorization.
4161868062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63058623.
The product of its (nonzero) digits is 110592, while the sum is 42.
The square root of 4161868062 is about 64512.5418969056. The cubic root of 4161868062 is about 1608.5310034679.
The spelling of 4161868062 in words is "four billion, one hundred sixty-one million, eight hundred sixty-eight thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •