Base | Representation |
---|---|
bin | 110001001001101001… |
… | …1011010101110010011 |
3 | 101002102222222210201202 |
4 | 1202103103122232103 |
5 | 3212131420243201 |
6 | 120253402421415 |
7 | 10424432631443 |
oct | 1422323325623 |
9 | 332388883652 |
10 | 105550556051 |
11 | 408445a0006 |
12 | 1855880186b |
13 | 9c51744935 |
14 | 51742b8123 |
15 | 2b2b693c6b |
hex | 18934dab93 |
105550556051 has 4 divisors (see below), whose sum is σ = 105553408752. Its totient is φ = 105547703352.
The previous prime is 105550556003. The next prime is 105550556071. The reversal of 105550556051 is 150655055501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105550556051 - 26 = 105550555987 is a prime.
It is a super-2 number, since 2×1055505560512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105550555996 and 105550556014.
It is not an unprimeable number, because it can be changed into a prime (105550556071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1370111 + ... + 1445096.
It is an arithmetic number, because the mean of its divisors is an integer number (26388352188).
Almost surely, 2105550556051 is an apocalyptic number.
105550556051 is a deficient number, since it is larger than the sum of its proper divisors (2852701).
105550556051 is an equidigital number, since it uses as much as digits as its factorization.
105550556051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2852700.
The product of its (nonzero) digits is 93750, while the sum is 38.
The spelling of 105550556051 in words is "one hundred five billion, five hundred fifty million, five hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •