Base | Representation |
---|---|
bin | 110001111100001100… |
… | …0001110011000011101 |
3 | 101020211011212021202010 |
4 | 1203320120032120131 |
5 | 3224120024040122 |
6 | 121133540421433 |
7 | 10514443431261 |
oct | 1437030163035 |
9 | 336734767663 |
10 | 107246315037 |
11 | 41534826914 |
12 | 189506a7879 |
13 | a161b67a14 |
14 | 52955b80a1 |
15 | 2bca4aae0c |
hex | 18f860e61d |
107246315037 has 8 divisors (see below), whose sum is σ = 143045254240. Its totient is φ = 71472459600.
The previous prime is 107246314999. The next prime is 107246315041. The reversal of 107246315037 is 730513642701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107246315037 - 216 = 107246249501 is a prime.
It is a super-2 number, since 2×1072463150372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 107246314986 and 107246315004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107246315237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6260962 + ... + 6278067.
It is an arithmetic number, because the mean of its divisors is an integer number (17880656780).
Almost surely, 2107246315037 is an apocalyptic number.
It is an amenable number.
107246315037 is a deficient number, since it is larger than the sum of its proper divisors (35798939203).
107246315037 is a wasteful number, since it uses less digits than its factorization.
107246315037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12541883.
The product of its (nonzero) digits is 105840, while the sum is 39.
Adding to 107246315037 its reverse (730513642701), we get a palindrome (837759957738).
The spelling of 107246315037 in words is "one hundred seven billion, two hundred forty-six million, three hundred fifteen thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •