Base | Representation |
---|---|
bin | 11000001010001010000001… |
… | …100101100000001101111001 |
3 | 111221012111121002212200012111 |
4 | 120022022001211200031321 |
5 | 102411304200203414401 |
6 | 1013551023043412321 |
7 | 31244246455355602 |
oct | 3012120145401571 |
9 | 457174532780174 |
10 | 106251075060601 |
11 | 30944911a03809 |
12 | bb002060840a1 |
13 | 47395831c2b53 |
14 | 1c348180dcda9 |
15 | c43c7ab2ce51 |
hex | 60a281960379 |
106251075060601 has 4 divisors (see below), whose sum is σ = 107836912001872. Its totient is φ = 104665238119332.
The previous prime is 106251075060593. The next prime is 106251075060661. The reversal of 106251075060601 is 106060570152601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106251075060601 - 23 = 106251075060593 is a prime.
It is a super-2 number, since 2×1062510750606012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106251075060661) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 792918470535 + ... + 792918470668.
It is an arithmetic number, because the mean of its divisors is an integer number (26959228000468).
Almost surely, 2106251075060601 is an apocalyptic number.
It is an amenable number.
106251075060601 is a deficient number, since it is larger than the sum of its proper divisors (1585836941271).
106251075060601 is an equidigital number, since it uses as much as digits as its factorization.
106251075060601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1585836941270.
The product of its (nonzero) digits is 75600, while the sum is 40.
The spelling of 106251075060601 in words is "one hundred six trillion, two hundred fifty-one billion, seventy-five million, sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •