Base | Representation |
---|---|
bin | 110001011011010111… |
… | …1000101110000000001 |
3 | 101010222102120100000001 |
4 | 1202312233011300001 |
5 | 3214341110401422 |
6 | 120432400000001 |
7 | 10445241502351 |
oct | 1426657056001 |
9 | 333872510001 |
10 | 106145012737 |
11 | 4101a102125 |
12 | 186a3900001 |
13 | a01794c35a |
14 | 51cd21ab61 |
15 | 2b63969227 |
hex | 18b6bc5c01 |
106145012737 has 6 divisors (see below), whose sum is σ = 109931399318. Its totient is φ = 102484839072.
The previous prime is 106145012713. The next prime is 106145012749. The reversal of 106145012737 is 737210541601.
It can be written as a sum of positive squares in 3 ways, for example, as 257249521 + 105887763216 = 16039^2 + 325404^2 .
It is not a de Polignac number, because 106145012737 - 231 = 103997529089 is a prime.
It is a super-2 number, since 2×1061450127372 (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 = 106145012696 and 106145012705.
It is not an unprimeable number, because it can be changed into a prime (106145012537) 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 5 ways as a sum of consecutive naturals, for example, 63105588 + ... + 63107269.
Almost surely, 2106145012737 is an apocalyptic number.
It is an amenable number.
106145012737 is a deficient number, since it is larger than the sum of its proper divisors (3786386581).
106145012737 is an equidigital number, since it uses as much as digits as its factorization.
106145012737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126212915 (or 126212886 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 37.
The spelling of 106145012737 in words is "one hundred six billion, one hundred forty-five million, twelve thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •