Base | Representation |
---|---|
bin | 1100101011110… |
… | …00010101001100 |
3 | 21102012122001122 |
4 | 12111320111030 |
5 | 204214232202 |
6 | 14320300112 |
7 | 2431243214 |
oct | 625702514 |
9 | 242178048 |
10 | 106399052 |
11 | 55072201 |
12 | 2b771638 |
13 | 19074326 |
14 | 101b9244 |
15 | 951a9a2 |
hex | 657854c |
106399052 has 12 divisors (see below), whose sum is σ = 186271176. Its totient is φ = 53178720.
The previous prime is 106399049. The next prime is 106399091. The reversal of 106399052 is 250993601.
It is a super-2 number, since 2×1063990522 = 22641516532997408, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15152 + ... + 21032.
It is an arithmetic number, because the mean of its divisors is an integer number (15522598).
Almost surely, 2106399052 is an apocalyptic number.
It is an amenable number.
106399052 is a deficient number, since it is larger than the sum of its proper divisors (79872124).
106399052 is a wasteful number, since it uses less digits than its factorization.
106399052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10408 (or 10406 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 35.
The square root of 106399052 is about 10314.9916141507. The cubic root of 106399052 is about 473.8554931078.
It can be divided in two parts, 10639 and 9052, that added together give a palindrome (19691).
The spelling of 106399052 in words is "one hundred six million, three hundred ninety-nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.798 sec. • engine limits •