Base | Representation |
---|---|
bin | 1001111011010010011110… |
… | …0101010110101101101001 |
3 | 1102122101101200122220020221 |
4 | 2132310213211112231221 |
5 | 2412304213024043141 |
6 | 35113523033250041 |
7 | 2204344312223362 |
oct | 236644745265551 |
9 | 42571350586227 |
10 | 10914176002921 |
11 | 3528748904704 |
12 | 12832a7563921 |
13 | 612282827c29 |
14 | 29a36b124b69 |
15 | 13dd81c6bbd1 |
hex | 9ed27956b69 |
10914176002921 has 27 divisors (see below), whose sum is σ = 11647473897423. Its totient is φ = 10224962941440.
The previous prime is 10914176002903. The next prime is 10914176002927. The reversal of 10914176002921 is 12920067141901.
The square root of 10914176002921 is 3303661.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 4172986898521 + 6741189104400 = 2042789^2 + 2596380^2 .
It is not a de Polignac number, because 10914176002921 - 29 = 10914176002409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10914176002927) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 20948514141 + ... + 20948514661.
Almost surely, 210914176002921 is an apocalyptic number.
10914176002921 is the 3303661-st square number.
10914176002921 is the 1651831-st centered octagonal number.
It is an amenable number.
10914176002921 is a deficient number, since it is larger than the sum of its proper divisors (733297894502).
10914176002921 is an frugal number, since it uses more digits than its factorization.
10914176002921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1822 (or 911 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 43.
The spelling of 10914176002921 in words is "ten trillion, nine hundred fourteen billion, one hundred seventy-six million, two thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •