Base | Representation |
---|---|
bin | 110001000100000010… |
… | …0001000100101010111 |
3 | 101001221212012011202021 |
4 | 1202020010020211113 |
5 | 3211240133001330 |
6 | 120222545154011 |
7 | 10416653140123 |
oct | 1421004104527 |
9 | 331855164667 |
10 | 105362000215 |
11 | 4075811423a |
12 | 1850562b907 |
13 | 9c21666634 |
14 | 5157234583 |
15 | 2b19d4a67a |
hex | 1888108957 |
105362000215 has 8 divisors (see below), whose sum is σ = 127357279920. Its totient is φ = 83674347072.
The previous prime is 105362000201. The next prime is 105362000269. The reversal of 105362000215 is 512000263501.
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 105362000215 - 217 = 105361869143 is a prime.
It is a super-2 number, since 2×1053620002152 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105362000215.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 76905885 + ... + 76907254.
It is an arithmetic number, because the mean of its divisors is an integer number (15919659990).
Almost surely, 2105362000215 is an apocalyptic number.
105362000215 is a deficient number, since it is larger than the sum of its proper divisors (21995279705).
105362000215 is a wasteful number, since it uses less digits than its factorization.
105362000215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153813281.
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 105362000215 its reverse (512000263501), we get a palindrome (617362263716).
The spelling of 105362000215 in words is "one hundred five billion, three hundred sixty-two million, two hundred fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •