Base | Representation |
---|---|
bin | 1001001110111000010100… |
… | …0001111000000111111001 |
3 | 1022221110010100012001210211 |
4 | 2103232011001320013321 |
5 | 2312304214313112301 |
6 | 33331225354111121 |
7 | 2065255115521654 |
oct | 223560501700771 |
9 | 38843110161724 |
10 | 10151239582201 |
11 | 3264131113673 |
12 | 117b46571b4a1 |
13 | 58834747a773 |
14 | 27147339489b |
15 | 1290cc77b051 |
hex | 93b850781f9 |
10151239582201 has 9 divisors (see below), whose sum is σ = 10163045050509. Its totient is φ = 10139447822400.
The previous prime is 10151239582199. The next prime is 10151239582217. The reversal of 10151239582201 is 10228593215101.
The square root of 10151239582201 is 3186101.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 422953821801 + 9728285760400 = 650349^2 + 3119020^2 .
It is not a de Polignac number, because 10151239582201 - 21 = 10151239582199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10151239382201) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4336282291 + ... + 4336284631.
Almost surely, 210151239582201 is an apocalyptic number.
10151239582201 is the 3186101-st square number.
10151239582201 is the 1593051-st centered octagonal number.
It is an amenable number.
10151239582201 is a deficient number, since it is larger than the sum of its proper divisors (11805468308).
10151239582201 is an frugal number, since it uses more digits than its factorization.
10151239582201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7404 (or 3702 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 40.
The spelling of 10151239582201 in words is "ten trillion, one hundred fifty-one billion, two hundred thirty-nine million, five hundred eighty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •