Base | Representation |
---|---|
bin | 110000111101110000… |
… | …0110111110101110001 |
3 | 101001102011222002201110 |
4 | 1201323200313311301 |
5 | 3210322231230001 |
6 | 120150024023533 |
7 | 10411515256602 |
oct | 1417340676561 |
9 | 331364862643 |
10 | 105151430001 |
11 | 4065a271772 |
12 | 18467001ba9 |
13 | 9bb9b4b087 |
14 | 513729dda9 |
15 | 2b066043d6 |
hex | 187b837d71 |
105151430001 has 8 divisors (see below), whose sum is σ = 140203463040. Its totient is φ = 70100175152.
The previous prime is 105151429997. The next prime is 105151430039. The reversal of 105151430001 is 100034151501.
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 105151430001 - 22 = 105151429997 is a prime.
It is a super-2 number, since 2×1051514300012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 105151430001.
It is not an unprimeable number, because it can be changed into a prime (105151430081) 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, 301240 + ... + 548678.
It is an arithmetic number, because the mean of its divisors is an integer number (17525432880).
Almost surely, 2105151430001 is an apocalyptic number.
It is an amenable number.
105151430001 is a deficient number, since it is larger than the sum of its proper divisors (35052033039).
105151430001 is a wasteful number, since it uses less digits than its factorization.
105151430001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389095.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 105151430001 its reverse (100034151501), we get a palindrome (205185581502).
The spelling of 105151430001 in words is "one hundred five billion, one hundred fifty-one million, four hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.022 sec. • engine limits •