Base | Representation |
---|---|
bin | 1001010011010001011111… |
… | …10000001111110001010011 |
3 | 2200102022220002020111021202 |
4 | 10221220233300033301103 |
5 | 10140102113433041321 |
6 | 111300102321141415 |
7 | 4210466124460214 |
oct | 451505760176123 |
9 | 80368802214252 |
10 | 20453435440211 |
11 | 65762870a4574 |
12 | 236401a18a86b |
13 | b5499b345b47 |
14 | 509d4710540b |
15 | 257092a2c70b |
hex | 129a2fc0fc53 |
20453435440211 has 4 divisors (see below), whose sum is σ = 20487926900232. Its totient is φ = 20418943980192.
The previous prime is 20453435440063. The next prime is 20453435440267. The reversal of 20453435440211 is 11204453435402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20453435440211 - 210 = 20453435439187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20453435446211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17245729121 + ... + 17245730306.
It is an arithmetic number, because the mean of its divisors is an integer number (5121981725058).
Almost surely, 220453435440211 is an apocalyptic number.
20453435440211 is a deficient number, since it is larger than the sum of its proper divisors (34491460021).
20453435440211 is an equidigital number, since it uses as much as digits as its factorization.
20453435440211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34491460020.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 20453435440211 its reverse (11204453435402), we get a palindrome (31657888875613).
The spelling of 20453435440211 in words is "twenty trillion, four hundred fifty-three billion, four hundred thirty-five million, four hundred forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •