Base | Representation |
---|---|
bin | 1001011010101001010111… |
… | …00001100001000000000101 |
3 | 2201022112210020021120022210 |
4 | 10231110223201201000011 |
5 | 10203224424442241404 |
6 | 112012320243214033 |
7 | 4235005001005251 |
oct | 455245341410005 |
9 | 81275706246283 |
10 | 20706767540229 |
11 | 66637664a7891 |
12 | 23a513a677319 |
13 | b72841845b44 |
14 | 5182da28b261 |
15 | 25d96d13a689 |
hex | 12d52b861005 |
20706767540229 has 16 divisors (see below), whose sum is σ = 27809673469760. Its totient is φ = 13704451015680.
The previous prime is 20706767540213. The next prime is 20706767540233. The reversal of 20706767540229 is 92204576760702.
It is not a de Polignac number, because 20706767540229 - 24 = 20706767540213 is a prime.
It is a super-2 number, since 2×207067675402292 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20706767540209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32731759 + ... + 33358380.
It is an arithmetic number, because the mean of its divisors is an integer number (1738104591860).
Almost surely, 220706767540229 is an apocalyptic number.
It is an amenable number.
20706767540229 is a deficient number, since it is larger than the sum of its proper divisors (7102905929531).
20706767540229 is a wasteful number, since it uses less digits than its factorization.
20706767540229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66090900.
The product of its (nonzero) digits is 17781120, while the sum is 57.
The spelling of 20706767540229 in words is "twenty trillion, seven hundred six billion, seven hundred sixty-seven million, five hundred forty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •