Base | Representation |
---|---|
bin | 1001100100011101101111… |
… | …11101000010011001011001 |
3 | 2202111210120200011201211102 |
4 | 10302032313331002121121 |
5 | 10224241340014423413 |
6 | 112431312413241145 |
7 | 4301250120141665 |
oct | 462166775023131 |
9 | 82453520151742 |
10 | 21044131014233 |
11 | 678384737a118 |
12 | 243a5b0a931b5 |
13 | b985b7435842 |
14 | 52a78176b8a5 |
15 | 267615ad8458 |
hex | 1323b7f42659 |
21044131014233 has 8 divisors (see below), whose sum is σ = 21723072783360. Its totient is φ = 20365195422240.
The previous prime is 21044131014229. The next prime is 21044131014281. The reversal of 21044131014233 is 33241013144012.
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 21044131014233 - 22 = 21044131014229 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21044131014196 and 21044131014205.
It is not an unprimeable number, because it can be changed into a prime (21044131014133) 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, 5957741 + ... + 8808117.
It is an arithmetic number, because the mean of its divisors is an integer number (2715384097920).
Almost surely, 221044131014233 is an apocalyptic number.
It is an amenable number.
21044131014233 is a deficient number, since it is larger than the sum of its proper divisors (678941769127).
21044131014233 is a wasteful number, since it uses less digits than its factorization.
21044131014233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3088567.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 21044131014233 its reverse (33241013144012), we get a palindrome (54285144158245).
The spelling of 21044131014233 in words is "twenty-one trillion, forty-four billion, one hundred thirty-one million, fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •