Base | Representation |
---|---|
bin | 1001000110010010010001… |
… | …01000100111000110010111 |
3 | 2121211200000111212210202002 |
4 | 10203021020220213012113 |
5 | 10110244144111121411 |
6 | 110315100410305515 |
7 | 4133320323223343 |
oct | 443111050470627 |
9 | 77750014783662 |
10 | 20007176270231 |
11 | 6413aa5467087 |
12 | 22b1636a2829b |
13 | b2188cc85c97 |
14 | 4d24d1380623 |
15 | 24a674dbd33b |
hex | 123248a27197 |
20007176270231 has 4 divisors (see below), whose sum is σ = 20122824688152. Its totient is φ = 19891527852312.
The previous prime is 20007176270227. The next prime is 20007176270269. The reversal of 20007176270231 is 13207267170002.
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 20007176270231 - 22 = 20007176270227 is a prime.
It is a super-2 number, since 2×200071762702312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20007176270831) 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 3 ways as a sum of consecutive naturals, for example, 57824208701 + ... + 57824209046.
It is an arithmetic number, because the mean of its divisors is an integer number (5030706172038).
Almost surely, 220007176270231 is an apocalyptic number.
20007176270231 is a deficient number, since it is larger than the sum of its proper divisors (115648417921).
20007176270231 is a wasteful number, since it uses less digits than its factorization.
20007176270231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115648417920.
The product of its (nonzero) digits is 49392, while the sum is 38.
The spelling of 20007176270231 in words is "twenty trillion, seven billion, one hundred seventy-six million, two hundred seventy thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •