Base | Representation |
---|---|
bin | 110010000001110010… |
… | …0100111000001111101 |
3 | 101021022021020022111220 |
4 | 1210003210213001331 |
5 | 3230011113023401 |
6 | 121204325503553 |
7 | 10522213606542 |
oct | 1440344470175 |
9 | 337267208456 |
10 | 107434111101 |
11 | 41620833879 |
12 | 189a3571bb9 |
13 | a191a3b255 |
14 | 52b2500bc9 |
15 | 2bdbc04336 |
hex | 190392707d |
107434111101 has 8 divisors (see below), whose sum is σ = 143311229280. Its totient is φ = 71589866832.
The previous prime is 107434111079. The next prime is 107434111117. The reversal of 107434111101 is 101111434701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107434111101 - 230 = 106360369277 is a prime.
It is a super-2 number, since 2×1074341111012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107434111151) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 8210850 + ... + 8223923.
It is an arithmetic number, because the mean of its divisors is an integer number (17913903660).
Almost surely, 2107434111101 is an apocalyptic number.
It is an amenable number.
107434111101 is a deficient number, since it is larger than the sum of its proper divisors (35877118179).
107434111101 is a wasteful number, since it uses less digits than its factorization.
107434111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16436955.
The product of its (nonzero) digits is 336, while the sum is 24.
Adding to 107434111101 its reverse (101111434701), we get a palindrome (208545545802).
The spelling of 107434111101 in words is "one hundred seven billion, four hundred thirty-four million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •