Base | Representation |
---|---|
bin | 110001010000111000… |
… | …0000000000010101001 |
3 | 101010001220001200020020 |
4 | 1202201300000002221 |
5 | 3213130442224321 |
6 | 120333421351053 |
7 | 10433435032065 |
oct | 1424160000251 |
9 | 333056050206 |
10 | 105792929961 |
11 | 40959395124 |
12 | 18605a08489 |
13 | 9c8ca17154 |
14 | 519856aaa5 |
15 | 2b42abd4c6 |
hex | 18a1c000a9 |
105792929961 has 8 divisors (see below), whose sum is σ = 147190163520. Its totient is φ = 67462158192.
The previous prime is 105792929939. The next prime is 105792929981. The reversal of 105792929961 is 169929297501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105792929961 - 229 = 105256059049 is a prime.
It is a super-2 number, since 2×1057929299612 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105792929895 and 105792929904.
It is not an unprimeable number, because it can be changed into a prime (105792929911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 766615366 + ... + 766615503.
It is an arithmetic number, because the mean of its divisors is an integer number (18398770440).
Almost surely, 2105792929961 is an apocalyptic number.
It is an amenable number.
105792929961 is a deficient number, since it is larger than the sum of its proper divisors (41397233559).
105792929961 is a wasteful number, since it uses less digits than its factorization.
105792929961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1533230895.
The product of its (nonzero) digits is 5511240, while the sum is 60.
The spelling of 105792929961 in words is "one hundred five billion, seven hundred ninety-two million, nine hundred twenty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •