Base | Representation |
---|---|
bin | 110001100011010111… |
… | …1111110110101001111 |
3 | 101011200011010010221110 |
4 | 1203012233332311033 |
5 | 3220413400310444 |
6 | 120515154303103 |
7 | 10455013241562 |
oct | 1430657766517 |
9 | 334604103843 |
10 | 106413681999 |
11 | 41147827339 |
12 | 18759887a93 |
13 | a05b4ca551 |
14 | 5216b964d9 |
15 | 2b7c339cb9 |
hex | 18c6bfed4f |
106413681999 has 8 divisors (see below), whose sum is σ = 141956830512. Its totient is φ = 70906494080.
The previous prime is 106413681953. The next prime is 106413682049. The reversal of 106413681999 is 999186314601.
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 106413681999 - 28 = 106413681743 is a prime.
It is a super-2 number, since 2×1064136819992 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106413681599) 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, 8983242 + ... + 8995079.
It is an arithmetic number, because the mean of its divisors is an integer number (17744603814).
Almost surely, 2106413681999 is an apocalyptic number.
106413681999 is a deficient number, since it is larger than the sum of its proper divisors (35543148513).
106413681999 is a wasteful number, since it uses less digits than its factorization.
106413681999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17980297.
The product of its (nonzero) digits is 2519424, while the sum is 57.
The spelling of 106413681999 in words is "one hundred six billion, four hundred thirteen million, six hundred eighty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •