Base | Representation |
---|---|
bin | 10111111100100000011000… |
… | …001001001001111101011111 |
3 | 111210212211021021002012112120 |
4 | 113330200120021021331133 |
5 | 102300422012301314244 |
6 | 1011552043055034023 |
7 | 31116420251610624 |
oct | 2774403011117537 |
9 | 453784237065476 |
10 | 105313003151199 |
11 | 30612aa2857988 |
12 | b98a44780b913 |
13 | 469bc86c71bcc |
14 | 1c0126864634b |
15 | c29676025819 |
hex | 5fc818249f5f |
105313003151199 has 8 divisors (see below), whose sum is σ = 140420211777840. Its totient is φ = 70207231646016.
The previous prime is 105313003151179. The next prime is 105313003151221. The reversal of 105313003151199 is 991151300313501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105313003151199 - 227 = 105312868933471 is a prime.
It is a super-2 number, since 2×1053130031511992 (a number of 29 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 105313003151199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105313003151129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 359109364 + ... + 359402505.
It is an arithmetic number, because the mean of its divisors is an integer number (17552526472230).
Almost surely, 2105313003151199 is an apocalyptic number.
105313003151199 is a deficient number, since it is larger than the sum of its proper divisors (35107208626641).
105313003151199 is an equidigital number, since it uses as much as digits as its factorization.
105313003151199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 718560729.
The product of its (nonzero) digits is 54675, while the sum is 42.
The spelling of 105313003151199 in words is "one hundred five trillion, three hundred thirteen billion, three million, one hundred fifty-one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •