Base | Representation |
---|---|
bin | 110001100100101001… |
… | …1010101101101111101 |
3 | 101011210010200210100102 |
4 | 1203021103111231331 |
5 | 3221010331131323 |
6 | 120523324210445 |
7 | 10456043235602 |
oct | 1431123255575 |
9 | 334703623312 |
10 | 106456505213 |
11 | 41169a16023 |
12 | 18770099a25 |
13 | a067342126 |
14 | 521c7426a9 |
15 | 2b80e98328 |
hex | 18c94d5b7d |
106456505213 has 8 divisors (see below), whose sum is σ = 106901718456. Its totient is φ = 106011763200.
The previous prime is 106456505189. The next prime is 106456505231. The reversal of 106456505213 is 312505654601.
It can be written as a sum of positive squares in 4 ways, for example, as 29218090489 + 77238414724 = 170933^2 + 277918^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106456505213 - 226 = 106389396349 is a prime.
It is a super-2 number, since 2×1064565052132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106456504213) 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, 338645 + ... + 572357.
It is an arithmetic number, because the mean of its divisors is an integer number (13362714807).
Almost surely, 2106456505213 is an apocalyptic number.
It is an amenable number.
106456505213 is a deficient number, since it is larger than the sum of its proper divisors (445213243).
106456505213 is a wasteful number, since it uses less digits than its factorization.
106456505213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235615.
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 106456505213 in words is "one hundred six billion, four hundred fifty-six million, five hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •