Base | Representation |
---|---|
bin | 1001001110110110010110… |
… | …0010010001110100011111 |
3 | 1022221101202111221201202110 |
4 | 2103231211202101310133 |
5 | 2312302124032031101 |
6 | 33331101121125103 |
7 | 2065236041426046 |
oct | 223554542216437 |
9 | 38841674851673 |
10 | 10150711205151 |
11 | 326398a935120 |
12 | 117b338789793 |
13 | 588291b6b31a |
14 | 27142313355d |
15 | 12909b1a9cd6 |
hex | 93b65891d1f |
10150711205151 has 32 divisors (see below), whose sum is σ = 15084715742208. Its totient is φ = 6018696627840.
The previous prime is 10150711205149. The next prime is 10150711205161. The reversal of 10150711205151 is 15150211705101.
It is not a de Polignac number, because 10150711205151 - 21 = 10150711205149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150711205161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2686161 + ... + 5245653.
It is an arithmetic number, because the mean of its divisors is an integer number (471397366944).
Almost surely, 210150711205151 is an apocalyptic number.
10150711205151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10150711205151 is a deficient number, since it is larger than the sum of its proper divisors (4934004537057).
10150711205151 is a wasteful number, since it uses less digits than its factorization.
10150711205151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2562111.
The product of its (nonzero) digits is 1750, while the sum is 30.
It can be divided in two parts, 1015071 and 1205151, that added together give a palindrome (2220222).
The spelling of 10150711205151 in words is "ten trillion, one hundred fifty billion, seven hundred eleven million, two hundred five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •