Base | Representation |
---|---|
bin | 1001100111100011000000… |
… | …11000101110100110000001 |
3 | 2202212220221101012111210002 |
4 | 10303301200120232212001 |
5 | 10233010233212414140 |
6 | 112552105322045345 |
7 | 4312016416161650 |
oct | 463614030564601 |
9 | 82786841174702 |
10 | 21150036060545 |
11 | 6814752a80987 |
12 | 2457028349855 |
13 | ba5594446412 |
14 | 53194ab61197 |
15 | 26a263451415 |
hex | 133c6062e981 |
21150036060545 has 8 divisors (see below), whose sum is σ = 29005763740224. Its totient is φ = 14502881870064.
The previous prime is 21150036060443. The next prime is 21150036060563. The reversal of 21150036060545 is 54506063005112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21150036060545 - 218 = 21150035798401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21150036060499 and 21150036060508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 302143372259 + ... + 302143372328.
It is an arithmetic number, because the mean of its divisors is an integer number (3625720467528).
Almost surely, 221150036060545 is an apocalyptic number.
It is an amenable number.
21150036060545 is a deficient number, since it is larger than the sum of its proper divisors (7855727679679).
21150036060545 is an equidigital number, since it uses as much as digits as its factorization.
21150036060545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604286744599.
The product of its (nonzero) digits is 108000, while the sum is 38.
Adding to 21150036060545 its reverse (54506063005112), we get a palindrome (75656099065657).
The spelling of 21150036060545 in words is "twenty-one trillion, one hundred fifty billion, thirty-six million, sixty thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •