Base | Representation |
---|---|
bin | 10011111101100101… |
… | …000010100000100001 |
3 | 2001022210020220120211 |
4 | 103331211002200201 |
5 | 322344124330213 |
6 | 13502521334121 |
7 | 1356105550042 |
oct | 237545024041 |
9 | 61283226524 |
10 | 21434214433 |
11 | 90aa067605 |
12 | 41a2337341 |
13 | 2037875728 |
14 | 10749828c9 |
15 | 856b1d53d |
hex | 4fd942821 |
21434214433 has 4 divisors (see below), whose sum is σ = 21436085440. Its totient is φ = 21432343428.
The previous prime is 21434214413. The next prime is 21434214467. The reversal of 21434214433 is 33441243412.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21434214433 - 229 = 20897343521 is a prime.
It is a super-2 number, since 2×214342144332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21434214395 and 21434214404.
It is not an unprimeable number, because it can be changed into a prime (21434214413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 918213 + ... + 941266.
It is an arithmetic number, because the mean of its divisors is an integer number (5359021360).
Almost surely, 221434214433 is an apocalyptic number.
It is an amenable number.
21434214433 is a deficient number, since it is larger than the sum of its proper divisors (1871007).
21434214433 is a wasteful number, since it uses less digits than its factorization.
21434214433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871006.
The product of its digits is 27648, while the sum is 31.
Adding to 21434214433 its reverse (33441243412), we get a palindrome (54875457845).
The spelling of 21434214433 in words is "twenty-one billion, four hundred thirty-four million, two hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •