Base | Representation |
---|---|
bin | 10111111101001110010110… |
… | …010001101010010000110011 |
3 | 111211001112200022010121010210 |
4 | 113331032112101222100303 |
5 | 102302224110132401011 |
6 | 1012030445104155203 |
7 | 31123115412514461 |
oct | 2775162621522063 |
9 | 454045608117123 |
10 | 105362363950131 |
11 | 30631a22727792 |
12 | b997b22608b03 |
13 | 46a382246c042 |
14 | 1c037cc107831 |
15 | c2aab47076a6 |
hex | 5fd39646a433 |
105362363950131 has 8 divisors (see below), whose sum is σ = 140983091977104. Its totient is φ = 69991605944960.
The previous prime is 105362363950097. The next prime is 105362363950139. The reversal of 105362363950131 is 131059363263501.
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 105362363950131 - 210 = 105362363949107 is a prime.
It is a super-2 number, since 2×1053623639501312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105362363950139) 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, 62492504466 + ... + 62492506151.
It is an arithmetic number, because the mean of its divisors is an integer number (17622886497138).
Almost surely, 2105362363950131 is an apocalyptic number.
105362363950131 is a deficient number, since it is larger than the sum of its proper divisors (35620728026973).
105362363950131 is a wasteful number, since it uses less digits than its factorization.
105362363950131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124985010901.
The product of its (nonzero) digits is 1312200, while the sum is 48.
The spelling of 105362363950131 in words is "one hundred five trillion, three hundred sixty-two billion, three hundred sixty-three million, nine hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •