Base | Representation |
---|---|
bin | 1001001000010010110110… |
… | …11100100010010000110011 |
3 | 2122002021012200120010212221 |
4 | 10210021123130202100303 |
5 | 10112412040101123111 |
6 | 110410514551501511 |
7 | 4141313142551242 |
oct | 444113334422063 |
9 | 78067180503787 |
10 | 20076211348531 |
11 | 6440300a141a8 |
12 | 2302aa2687897 |
13 | b28242525a40 |
14 | 4d599db7a959 |
15 | 24c36592b371 |
hex | 12425b722433 |
20076211348531 has 8 divisors (see below), whose sum is σ = 21632343371744. Its totient is φ = 18521766192960.
The previous prime is 20076211348477. The next prime is 20076211348537. The reversal of 20076211348531 is 13584311267002.
It is a happy number.
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 20076211348531 - 211 = 20076211346483 is a prime.
It is a super-2 number, since 2×200762113485312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20076211348537) by changing a digit.
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, 421692186 + ... + 421739791.
It is an arithmetic number, because the mean of its divisors is an integer number (2704042921468).
Almost surely, 220076211348531 is an apocalyptic number.
20076211348531 is a deficient number, since it is larger than the sum of its proper divisors (1556132023213).
20076211348531 is a wasteful number, since it uses less digits than its factorization.
20076211348531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843433821.
The product of its (nonzero) digits is 241920, while the sum is 43.
The spelling of 20076211348531 in words is "twenty trillion, seventy-six billion, two hundred eleven million, three hundred forty-eight thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •