Base | Representation |
---|---|
bin | 110001101110000111… |
… | …1011000011110110001 |
3 | 101012121021120010202102 |
4 | 1203130033120132301 |
5 | 3222133201010212 |
6 | 121015034230145 |
7 | 10466652010640 |
oct | 1433417303661 |
9 | 335537503672 |
10 | 106774235057 |
11 | 413122aa176 |
12 | 1883a585355 |
13 | a0b8109c59 |
14 | 524ca0d357 |
15 | 2b9dd0a5c2 |
hex | 18dc3d87b1 |
106774235057 has 4 divisors (see below), whose sum is σ = 122027697216. Its totient is φ = 91520772900.
The previous prime is 106774235047. The next prime is 106774235063. The reversal of 106774235057 is 750532477601.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 750532477601 = 140759 ⋅5332039.
It is a cyclic number.
It is not a de Polignac number, because 106774235057 - 24 = 106774235041 is a prime.
It is a super-2 number, since 2×1067742350572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106774235047) 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, 7626731069 + ... + 7626731082.
It is an arithmetic number, because the mean of its divisors is an integer number (30506924304).
Almost surely, 2106774235057 is an apocalyptic number.
It is an amenable number.
106774235057 is a deficient number, since it is larger than the sum of its proper divisors (15253462159).
106774235057 is an equidigital number, since it uses as much as digits as its factorization.
106774235057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15253462158.
The product of its (nonzero) digits is 1234800, while the sum is 47.
The spelling of 106774235057 in words is "one hundred six billion, seven hundred seventy-four million, two hundred thirty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •