Base | Representation |
---|---|
bin | 1001100111110111011101… |
… | …10000001100101001001101 |
3 | 2202220222021111002122020211 |
4 | 10303323232300030221031 |
5 | 10233200224203342310 |
6 | 113001122540242421 |
7 | 4312555444366441 |
oct | 463735660145115 |
9 | 82828244078224 |
10 | 21161014512205 |
11 | 6819377031127 |
12 | 2459190b40411 |
13 | ba6623a67969 |
14 | 5322acc22821 |
15 | 26a6a7185c8a |
hex | 133eeec0ca4d |
21161014512205 has 8 divisors (see below), whose sum is σ = 25561384418304. Its totient is φ = 16816700274000.
The previous prime is 21161014512203. The next prime is 21161014512229. The reversal of 21161014512205 is 50221541016112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21161014512205 - 21 = 21161014512203 is a prime.
It is a super-2 number, since 2×211610145122052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21161014512203) 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, 14013916141 + ... + 14013917650.
It is an arithmetic number, because the mean of its divisors is an integer number (3195173052288).
Almost surely, 221161014512205 is an apocalyptic number.
It is an amenable number.
21161014512205 is a deficient number, since it is larger than the sum of its proper divisors (4400369906099).
21161014512205 is a wasteful number, since it uses less digits than its factorization.
21161014512205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28027833947.
The product of its (nonzero) digits is 4800, while the sum is 31.
Adding to 21161014512205 its reverse (50221541016112), we get a palindrome (71382555528317).
The spelling of 21161014512205 in words is "twenty-one trillion, one hundred sixty-one billion, fourteen million, five hundred twelve thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •