Base | Representation |
---|---|
bin | 110001000000010000… |
… | …1100100110001100011 |
3 | 101001122001011022020222 |
4 | 1202000201210301203 |
5 | 3211010242001011 |
6 | 120202225553255 |
7 | 10413555664166 |
oct | 1420041446143 |
9 | 331561138228 |
10 | 105235500131 |
11 | 406a2772913 |
12 | 1848b1a582b |
13 | 9c013a4c08 |
14 | 5144505add |
15 | 2b0dbadddb |
hex | 1880864c63 |
105235500131 has 8 divisors (see below), whose sum is σ = 106447526640. Its totient is φ = 104029972992.
The previous prime is 105235500067. The next prime is 105235500133. The reversal of 105235500131 is 131005532501.
It is a happy number.
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 105235500131 - 26 = 105235500067 is a prime.
It is a super-2 number, since 2×1052355001312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105235500131.
It is not an unprimeable number, because it can be changed into a prime (105235500133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1592270 + ... + 1657043.
It is an arithmetic number, because the mean of its divisors is an integer number (13305940830).
Almost surely, 2105235500131 is an apocalyptic number.
105235500131 is a deficient number, since it is larger than the sum of its proper divisors (1212026509).
105235500131 is a wasteful number, since it uses less digits than its factorization.
105235500131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3249685.
The product of its (nonzero) digits is 2250, while the sum is 26.
The spelling of 105235500131 in words is "one hundred five billion, two hundred thirty-five million, five hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •