Base | Representation |
---|---|
bin | 1100101110001… |
… | …11110000101101 |
3 | 21102211011100110 |
4 | 12113013300231 |
5 | 204310140042 |
6 | 14331250233 |
7 | 2434066563 |
oct | 627076055 |
9 | 242734313 |
10 | 106724397 |
11 | 5527468a |
12 | 2b8a9979 |
13 | 19159440 |
14 | 10261a33 |
15 | 958209c |
hex | 65c7c2d |
106724397 has 8 divisors (see below), whose sum is σ = 153245344. Its totient is φ = 65676528.
The previous prime is 106724383. The next prime is 106724461. The reversal of 106724397 is 793427601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106724397 - 24 = 106724381 is a prime.
It is a super-2 number, since 2×1067243972 = 22780193830027218, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 2736523 = 106724397 / (1 + 0 + 6 + 7 + 2 + 4 + 3 + 9 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106724797) 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, 1368223 + ... + 1368300.
It is an arithmetic number, because the mean of its divisors is an integer number (19155668).
Almost surely, 2106724397 is an apocalyptic number.
It is an amenable number.
106724397 is a deficient number, since it is larger than the sum of its proper divisors (46520947).
106724397 is a wasteful number, since it uses less digits than its factorization.
106724397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2736539.
The product of its (nonzero) digits is 63504, while the sum is 39.
The square root of 106724397 is about 10330.7500695738. The cubic root of 106724397 is about 474.3379837663.
The spelling of 106724397 in words is "one hundred six million, seven hundred twenty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •