Base | Representation |
---|---|
bin | 110001011000000000… |
… | …1111010101111010001 |
3 | 101010200120212111022122 |
4 | 1202300001322233101 |
5 | 3214123310222412 |
6 | 120413300344025 |
7 | 10442404305653 |
oct | 1426001725721 |
9 | 333616774278 |
10 | 106032507857 |
11 | 40a7164a591 |
12 | 186720a5015 |
13 | 9cca54ab13 |
14 | 51bc2d26d3 |
15 | 2b58b44572 |
hex | 18b007abd1 |
106032507857 has 4 divisors (see below), whose sum is σ = 106309355520. Its totient is φ = 105755660196.
The previous prime is 106032507839. The next prime is 106032507881. The reversal of 106032507857 is 758705230601.
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.
It is a cyclic number.
It is not a de Polignac number, because 106032507857 - 214 = 106032491473 is a prime.
It is a super-2 number, since 2×1060325078572 (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 (106032507557) 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 3 ways as a sum of consecutive naturals, for example, 138423257 + ... + 138424022.
It is an arithmetic number, because the mean of its divisors is an integer number (26577338880).
Almost surely, 2106032507857 is an apocalyptic number.
It is an amenable number.
106032507857 is a deficient number, since it is larger than the sum of its proper divisors (276847663).
106032507857 is an equidigital number, since it uses as much as digits as its factorization.
106032507857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276847662.
The product of its (nonzero) digits is 352800, while the sum is 44.
The spelling of 106032507857 in words is "one hundred six billion, thirty-two million, five hundred seven thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •