Base | Representation |
---|---|
bin | 10111111000110101010011… |
… | …110001101011110111001011 |
3 | 111202222200202220002010101210 |
4 | 113320311103301223313023 |
5 | 102232303102220423344 |
6 | 1011240101255344203 |
7 | 31062243423156201 |
oct | 2770652361536713 |
9 | 452880686063353 |
10 | 105060600561099 |
11 | 30525a50102187 |
12 | b949546682063 |
13 | 46812311cb491 |
14 | 1bd2d62add071 |
15 | c22d02322db9 |
hex | 5f8d53c6bdcb |
105060600561099 has 8 divisors (see below), whose sum is σ = 140101519722192. Its totient is φ = 70030040887040.
The previous prime is 105060600561071. The next prime is 105060600561101. The reversal of 105060600561099 is 990165006060501.
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 105060600561099 - 25 = 105060600561067 is a prime.
It is a super-2 number, since 2×1050606005610992 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105060600561019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2589848094 + ... + 2589888659.
It is an arithmetic number, because the mean of its divisors is an integer number (17512689965274).
Almost surely, 2105060600561099 is an apocalyptic number.
105060600561099 is a deficient number, since it is larger than the sum of its proper divisors (35040919161093).
105060600561099 is an equidigital number, since it uses as much as digits as its factorization.
105060600561099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5179743517.
The product of its (nonzero) digits is 437400, while the sum is 48.
The spelling of 105060600561099 in words is "one hundred five trillion, sixty billion, six hundred million, five hundred sixty-one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •