Base | Representation |
---|---|
bin | 110001010100010010… |
… | …1100110100001001101 |
3 | 101010100212220202222121 |
4 | 1202220211212201031 |
5 | 3213344324110433 |
6 | 120353040212541 |
7 | 10436330060560 |
oct | 1425045464115 |
9 | 333325822877 |
10 | 105907644493 |
11 | 40a08116922 |
12 | 1863830a151 |
13 | 9caa710381 |
14 | 51a98ac4d7 |
15 | 2b4cbccc2d |
hex | 18a896684d |
105907644493 has 4 divisors (see below), whose sum is σ = 121037308000. Its totient is φ = 90777980988.
The previous prime is 105907644481. The next prime is 105907644503. The reversal of 105907644493 is 394446709501.
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 105907644493 - 213 = 105907636301 is a prime.
It is a super-2 number, since 2×1059076444932 (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 105907644493.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105907644433) 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, 7564831743 + ... + 7564831756.
It is an arithmetic number, because the mean of its divisors is an integer number (30259327000).
Almost surely, 2105907644493 is an apocalyptic number.
It is an amenable number.
105907644493 is a deficient number, since it is larger than the sum of its proper divisors (15129663507).
105907644493 is an equidigital number, since it uses as much as digits as its factorization.
105907644493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15129663506.
The product of its (nonzero) digits is 3265920, while the sum is 52.
The spelling of 105907644493 in words is "one hundred five billion, nine hundred seven million, six hundred forty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •