Base | Representation |
---|---|
bin | 110001000101100111… |
… | …0110100111111101101 |
3 | 101002002120011201021011 |
4 | 1202023032310333231 |
5 | 3211342233311323 |
6 | 120232124105221 |
7 | 10421166602503 |
oct | 1421316647755 |
9 | 332076151234 |
10 | 105415135213 |
11 | 40785106363 |
12 | 1851b395211 |
13 | 9c2c67b96b |
14 | 5160306673 |
15 | 2b1e84420d |
hex | 188b3b4fed |
105415135213 has 4 divisors (see below), whose sum is σ = 107201832480. Its totient is φ = 103628437948.
The previous prime is 105415135211. The next prime is 105415135237. The reversal of 105415135213 is 312531514501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105415135213 - 21 = 105415135211 is a prime.
It is a super-2 number, since 2×1054151352132 (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 (105415135211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 893348545 + ... + 893348662.
It is an arithmetic number, because the mean of its divisors is an integer number (26800458120).
Almost surely, 2105415135213 is an apocalyptic number.
It is an amenable number.
105415135213 is a deficient number, since it is larger than the sum of its proper divisors (1786697267).
105415135213 is an equidigital number, since it uses as much as digits as its factorization.
105415135213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1786697266.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 105415135213 its reverse (312531514501), we get a palindrome (417946649714).
The spelling of 105415135213 in words is "one hundred five billion, four hundred fifteen million, one hundred thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •